Hi Bill, I tried recently to have a look at gnetman, but the link in geda page is broken (http://viasic.com/opensource) . Now you mentioned datadraw, I checked the webpage, and the link in http://datadraw.sourceforge.net is broken as well.
Did you move gnetman to another site? Can you make it available again? Thanks, Carlos El lun, 09-06-2008 a las 04:53 -0400, Bill Cox escribió: > Hi, all. > > I've recently benchmarked DataDraw (datadraw.sf.net) graph databases vs > GNU C++ graphs built using STL lists. Large graphs (4 million nodes) > were built in the shape of a mesh. Then, simple depth first traversals > were performed starting from a corner, a hundred times. > > The C/DataDraw based implementation ran 15X faster than the C++/STL > version, while using less than half the memory. > > The performance difference is due mostly to cache-optimized memory > organization, which gave the DataDraw version a 16.7X lower L2 cache > miss rate, according to cachegrind. I estimate the DataDraw version > achieved around 30X higher useful information density in the cache. > This is due to several factors, which are roughly: > > Keeping like data fields together, rather than object fields: 4X > Using a memory pool per field, rather than a global pool: 2X > Using 32-bit object references rather than 64-bit pointers: 2X > Embedding next pointers in edges rather than allocating link object: 2X > > The benchmarks can be found in the expamples/graph_benchmark directory > of the source code, which can be checked out with: > > svn co https://datadraw.svn.sourceforge.net/svnroot/datadraw/trunk > datadraw > > Best regards, > Bill > > > > > _______________________________________________ > geda-user mailing list > [email protected] > http://www.seul.org/cgi-bin/mailman/listinfo/geda-user _______________________________________________ geda-user mailing list [email protected] http://www.seul.org/cgi-bin/mailman/listinfo/geda-user
