Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.22764 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912650734075904 |
|---|---|
| author | Koch, Stefan Sanders, Peter Williams, Marvin |
| author_facet | Koch, Stefan Sanders, Peter Williams, Marvin |
| contents | FIFO queues are a fundamental data structure used in a wide range of applications. Concurrent FIFO queues allow multiple execution threads to access the queue simultaneously. Maintaining strict FIFO semantics in concurrent queues leads to low throughput due to high contention at the head and tail of the queue. By relaxing the FIFO semantics to allow some reordering of elements, it becomes possible to achieve much higher scalability. This work presents two orthogonal designs for relaxed concurrent FIFO queues, one derived from the MultiQueue and the other based on ring buffers. We evaluate both designs extensively on various micro-benchmarks and a breadth-first search application on large graphs. Both designs outperform state-of-the-art relaxed and strict FIFO queues, achieving higher throughput and better scalability. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_22764 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | BlockFIFO & MultiFIFO: Scalable Relaxed Queues Koch, Stefan Sanders, Peter Williams, Marvin Data Structures and Algorithms D.1.3; E.1 FIFO queues are a fundamental data structure used in a wide range of applications. Concurrent FIFO queues allow multiple execution threads to access the queue simultaneously. Maintaining strict FIFO semantics in concurrent queues leads to low throughput due to high contention at the head and tail of the queue. By relaxing the FIFO semantics to allow some reordering of elements, it becomes possible to achieve much higher scalability. This work presents two orthogonal designs for relaxed concurrent FIFO queues, one derived from the MultiQueue and the other based on ring buffers. We evaluate both designs extensively on various micro-benchmarks and a breadth-first search application on large graphs. Both designs outperform state-of-the-art relaxed and strict FIFO queues, achieving higher throughput and better scalability. |
| title | BlockFIFO & MultiFIFO: Scalable Relaxed Queues |
| topic | Data Structures and Algorithms D.1.3; E.1 |
| url | https://arxiv.org/abs/2507.22764 |