A benchmark framework for concurrent queue implementations
The developer of this repository has not created any items for sale yet. Need a bug fixed? Help with integration? A different license? Create a request here:
This is a benchmark framework for evaluating the performance of concurrent queues. Currently, it contains four concurrent queue implementations. They are:
The benchmark framework also includes a synthetic queue benchmark,
faa, which emulates both an enqueue and a dequeue with a
fetch-and-addprimitive to test the performance of
fetch-and-addon a system.
The framework currently contains one benchmark,
pairwise, in which all threads repeatedly execute pairs of enqueue and dequeue operations. Between two operations,
pairwiseuses a delay routine that adds an arbitrary delay (between 50~150ns) to avoid artificial long run scenarios, where a cache line is held by one thread for a long time.
__syncprimitives for atomic memory access.
sched_setaffinityto bind threads to cores.
CAS2, a 16 Byte wide
compare-and-swapprimitive. This is available on most recent Intel processors and IBM Power8.
jemalloceliminates the bottleneck of the memory allocator. You can link with
JEMALLOC_PATHenvironment variable to the path where your
Download one of the released source code tarball, then execute the following commands. The filename used may be different depending on the name of the tarball you have downloaded.
$ tar zxf fast-wait-free-queue-1.0.0.tar.gz $ cd fast-wait-free-queue-1.0.0 $ make
This should generate 6 binaries (or 5 if your system does not support
lcrqwill fail to compile):
delay. These are the
pairwisebenchmark compiled using different queue implementations. -
wfqueue0: the same as
wfqueueexcept that its
PATIENCEis set to
delay: a synthetic benchmark used to measure the time spent in the delay routine.
You can execute a binary directly, using the number of threads as an argument. Without an argument, the execution will use all available cores on the system.
wfqueuewith 8 threads.
If you would like to verify the result, compile the binary with
VERIFY=1 make. Then execute a binary directly will print either
PASSEDor error messages.
You can also use the
driverscript, which invokes a binary up to 10 times and measures the mean of running times, the running time of the current run, the standard deviation, margin of error (both in time and percentage) of each run. The script terminates when the margin of error is relatively small (< 0.02), or has invoked the binary 10 times.
./driver ./wfqueue 8runs
wfqueuewith 8 threads up to 10 times and collect statistic results.
You can use the
benchmarkscript, which invokes
driveron all combinations of a list of binaries and a list of numbers of threads, and report the
mean running timeand
margin of errorfor each combination. You can specify the list of binaries using the environment variable
TESTS. You can specify the list of numbers of threads using the environment variable
The generated output of
benchmarkcan be used as a datafile for gnuplot. The first column of
benchmark's output is the number threads. Then every two columns are the
mean running timeand
margin of errorfor each queue implementation. They are in the same order as they are specified in
TESTS=wfqueue:lcrq:faa:delay PROCS=1:2:4:8 ./benchmarkruns each of
delayusing 1, 2, 4, and 8 threads.
Then you can plot them using,
set logscale x 2 plot "t" using 1:(20000/($2-$8)) t "wfqueue" w lines, \ "t" using 1:(20000/($4-$8)) t "lcrq" w lines, \ "t" using 1:(20000/($6-$8)) t "faa" w lines
By default, the framework will map a thread with id
ito the core with id
i % p, where p is the number of available cores on a system; you can check each core's id in
To implement a custom mapping, you can add a
cpumap.h. The signature of
int cpumap(int id, int nprocs)where
idis the id of the current thread,
nprocsis the number of threads.
cpumapshould return the corresponding core id for the thread.
cpumap.hcontains several examples of the cpumap function. You should guard the definition of the added
cpumapusing a conditional macro, and add the macro to
CFLAGSin the makefile.
We use a generic pointer
void *to represent a value that can be stored in the queue. A queue should implements the queue interface, defined in
queue_t: the struct type of the queue,
handle_t: a thread's handle to the queue, used to store thread local state,
void queue_init(queue_t * q, int nprocs): initialize a queue; this will be called only once,
void queue_register(queue_t * q, handle_t * th, int id): initialize a thread's handle; this will be called by every thread that uses the queue,
void enqueue(queue_t * q, handle_t * th, void * val): enqueues a value,
void * dequeue(queue_t * q, handle_t * th): dequeues a value,
void queue_free(queue_t * q, handle_t * h): deallocate a queue and cleanup all resources associated with it,
EMPTY: a value that will be returned if a
dequeuefails. This should be a macro that is defined in the header file.
A benchmark should implement the benchmark interface, defined in
benchmark.h, and interact with a queue using the queue interface. The benchmark interface includes:
void init(int nprocs, int n): performs initialization of the benchmark; called only once at the beginning.
void thread_init(int id, int nprocs): performs thread local initialization of the benchmark; called once per thread, after
void * benchmark(int id, int nprocs): run the benchmark once, called by each thread to run the benchmark. Each call will be timed and report as one iteration. It can return a result, which will be passed to
verifyto verify correctness.
int verify(int nprocs, void * results): should verify the result of each thread and return
0on success and non-zero values on error.