One line description of this code.
Explain briefly how to build your program.
Show an example run of your (completed) program on using the -t and -s flags
of a run where the base hash table completes in between 1-2 seconds.
Describe your first implementation strategy here (the one with a single mutex). Argue why your strategy is correct.
Run the tester such that the base hash table completes in 1-2 seconds.
Report the relative speedup (or slow down) with a low number of threads and a
high number of threads. Note that the amount of work (-t times -s) should
remain constant. Explain any differences between the two.
Describe your second implementation strategy here (the one with a multiple mutexes). Argue why your strategy is correct.
Run the tester such that the base hash table completes in 1-2 seconds.
Report the relative speedup with number of threads equal to the number of
physical cores on your machine (at least 4). Note again that the amount of work
(-t times -s) should remain constant. Report the speedup relative to the
base hash table implementation. Explain the difference between this
implementation and your first, which respect why you get a performance increase.
Explain briefly how to clean up all binary files.