I tried for some time to generate a small working example but failed. The class I added instantiates a number of nested STL vector containers. I tried all sorts of combinations, large and small. My timing tests for the tests showed (sigh) that the polymorphic archives were always faster than the non-polymorphic case (binary and xml). So, sorry to report, I'm not sure what is causing the behavior I observe in my application. Frustrating. I'd like to understand this. On Tue, Mar 30, 2010 at 10:41:57PM -0800, Robert Ramey wrote:
Martin Weinberg wrote:
Thanks to all for the suggestions. I did end up using valgrind --tool=callgrind and kcachegrind. Compiling with -pg was not feasible.
Anyway, I found that all the time (80%) was spent in reset_object_address(). Eliminating the polymorphic archives decreased the load time by a factor of 1000!
I would be interested if you could make a small test case which demonstrates this.
Robert Ramey
_______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users
-- Martin Weinberg Phone: (413) 545-3821 Dept. of Astronomy FAX: (413) 545-4223 530 Graduate Research Tower weinberg@astro.umass.edu University of Massachusetts Amherst, MA 01003-4525