https://github.com/mackstann/hash-table-shootout

A benchmark of some prominent C/C++ hash table implementations
https://github.com/mackstann/hash-table-shootout

Last synced: 3 months ago
JSON representation

A benchmark of some prominent C/C++ hash table implementations

• Host: GitHub
• URL: https://github.com/mackstann/hash-table-shootout
• Owner: mackstann
• Created: 2010-03-23T04:40:46.000Z (over 14 years ago)
• Default Branch: master
• Last Pushed: 2019-02-27T13:53:43.000Z (over 5 years ago)
• Last Synced: 2024-07-18T21:58:01.411Z (4 months ago)
• Language: Python
• Homepage:
• Size: 189 KB
• Stars: 102
• Watchers: 8
• Forks: 60
• Open Issues: 4
• Metadata Files:
  • Readme: README

Awesome Lists containing this project

README

        
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/