Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.16023 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909748683603968 |
|---|---|
| author | Grimes, Olivia Hassan, Ahmed Fatourou, Panagiota Palmieri, Roberto |
| author_facet | Grimes, Olivia Hassan, Ahmed Fatourou, Panagiota Palmieri, Roberto |
| contents | This paper presents PIPQ, a strict and linearizable concurrent priority queue whose design differs from existing solutions in literature because it focuses on enabling parallelism of insert operations as opposed to accelerating delete-min operations, as traditionally done. In a nutshell, PIPQ's structure includes two levels: the worker level and the leader level. The worker level provides per-thread data structures enabling fast and parallel insertions. The leader level contains the highest priority elements in the priority queue and can thus serve delete-min operations. Our evaluation, which includes an exploration of different data access patterns, operation mixes, runtime settings, and an integration into a graph-based application, shows that PIPQ outperforms competitors in a variety of cases, especially with insert-dominant workloads. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_16023 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | PIPQ: Strict Insert-Optimized Concurrent Priority Queue Grimes, Olivia Hassan, Ahmed Fatourou, Panagiota Palmieri, Roberto Data Structures and Algorithms This paper presents PIPQ, a strict and linearizable concurrent priority queue whose design differs from existing solutions in literature because it focuses on enabling parallelism of insert operations as opposed to accelerating delete-min operations, as traditionally done. In a nutshell, PIPQ's structure includes two levels: the worker level and the leader level. The worker level provides per-thread data structures enabling fast and parallel insertions. The leader level contains the highest priority elements in the priority queue and can thus serve delete-min operations. Our evaluation, which includes an exploration of different data access patterns, operation mixes, runtime settings, and an integration into a graph-based application, shows that PIPQ outperforms competitors in a variety of cases, especially with insert-dominant workloads. |
| title | PIPQ: Strict Insert-Optimized Concurrent Priority Queue |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2508.16023 |