{"ID":2879240,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2508.16023","arxiv_id":"2508.16023","title":"PIPQ: Strict Insert-Optimized Concurrent Priority Queue","abstract":"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.","short_abstract":"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 l...","url_abs":"https://arxiv.org/abs/2508.16023","url_pdf":"https://arxiv.org/pdf/2508.16023v1","authors":"[\"Olivia Grimes\",\"Ahmed Hassan\",\"Panagiota Fatourou\",\"Roberto Palmieri\"]","published":"2025-08-22T00:58:57Z","proceeding":"cs.DS","tasks":"[\"cs.DS\"]","methods":"[\"LoRA\"]","has_code":false}