Join GitHub today
GitHub is home to over 28 million developers working together to host and review code, manage projects, and build software together.Sign up
A benchmark of some prominent C/C++ hash table implementations
Fetching latest commit…
Cannot retrieve the latest commit at this time.
|Failed to load latest commit information.|
How to run these benchmarks: First, some prerequisites are: * make * gcc and recent g++ (4.3-ish?) * python (hard-coded for 2.6 -- edit Makefile to use another version) * glib * boost * google sparsehash * qt Now, run: $ make $ python bench.py $ python make_chart_data.py < output | python make_html.py Your charts are now in charts.html. You can tweak some of the values in bench.py to make it run faster at the expense of less granular data, and you might need to tweak some of the tickSize settings in charts-template.html. To run the benchmark at the highest priority possible, do this: $ sudo nice -n-20 ionice -c1 -n0 sudo -u $USER python bench.py You might also want to disable any swap files/partitions so that swapping doesn't influence performance. (The programs will just die if they try to allocate too much memory.) Copyright Information ===================== Written by Nick Welch in 2010. No copyright. This work is dedicated to the public domain. For full details, see http://creativecommons.org/publicdomain/zero/1.0/