The Next 700 Benchmarking Frameworks for Concurrent Data Structures
Galiev, R., Spear, M. & Aksenov, V.
ORCID: 0000-0001-9134-5490 (2024).
The Next 700 Benchmarking Frameworks for Concurrent Data Structures.
In:
Proceedings of the 2024 Workshop on Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems.
ApPLIED'24: 2024 Workshop on Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems, 17 June 2024, Nantes, France.
doi: 10.1145/3663338.3665827
Abstract
Concurrent data structures are essential building blocks for applications in almost every domain. However, differences among domains make it difficult to share results. Some testing frameworks model specific workloads, while others emphasize stress tests, but there is no easy way to evaluate if a new data structure will accelerate an application based only on such benchmarks. A confounding factor is the huge space of configuration options.
We address these issues with a new benchmarking tool for concurrent data structures in Java and C++. Our tool emphasizes a declarative description of workloads, a modular approach to defining components, and heterogeneity throughout.
As preliminary evidence of the effectiveness of our tool, we show that it can implement important and realistic workloads. We present six different workloads that lead to all six possibilities of relevant performance of the three most popular binary search trees written in Java.
| Publication Type: | Conference or Workshop Item (Paper) |
|---|---|
| Additional Information: | © 2024 Copyright held by the owner/author(s). Publication rights licensed to ACM Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org |
| Publisher Keywords: | concurrency, benchmark, data structures |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA76 Computer software |
| Departments: | School of Science & Technology School of Science & Technology > Department of Computer Science |
| SWORD Depositor: |
Download (640kB) | Preview
Export
Downloads
Downloads per month over past year
Metadata
Metadata