Concurrent data structures such as concurrent queues, stacks, and pools are widely used for concurrent programming of sharedmemory multiprocessor and multicore machines. The key challenge is to develop data structures that are not only fast on a given machine but whose performance scales, ideally linearly, with the number of threads, cores, and processors on even bigger machines. Part of that challenge is to provide a common ground for systematically evaluating the performance and scalability of new concurrent data structures and comparing the results with the performance and scalability of existing solutions. For this purpose, we have developed Scal which is an open-source benchmarking framework that provides (1) software infrastructure for executing concurrent data structure algorithms, (2) workloads for benchmarking their performance and scalability, and (3) implementations of a large set of concurrent data structures. We discuss the Scal infrastructure, workloads, and implementations, and encourage further use and development of Scal in the design and implementation of ever faster concurrent data structures.
CITATION STYLE
Haas, A., Hütter, T., Kirsch, C. M., Lippautz, M., Preishuber, M., & Sokolova, A. (2015). Scal: A benchmarking suite for concurrent data structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9466, pp. 1–14). Springer Verlag. https://doi.org/10.1007/978-3-319-26850-7_1
Mendeley helps you to discover research relevant for your work.