Document Open Access Logo

Brief Announcement: Concurrent Double-Ended Priority Queues

Authors Panagiota Fatourou , Eric Ruppert , Ioannis Xiradakis

PDF

File

Thumbnail PDF
PDF
LIPIcs.DISC.2025.55.pdf
  • Filesize: 0.59 MB
  • 7 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Concurrent algorithms
  • Theory of computation → Data structures design and analysis
Keywords
  • shared-memory
  • data structure
  • double-ended
  • priority queue
  • priority deque
  • heap
  • skip list
  • combining

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

This work provides the first concurrent implementation of a double-ended priority queue (DEPQ). We describe a general way to add an ExtractMax operation to any concurrent priority queue that already supports Insert and ExtractMin.

Cite As Get BibTex

Panagiota Fatourou, Eric Ruppert, and Ioannis Xiradakis. Brief Announcement: Concurrent Double-Ended Priority Queues. In 39th International Symposium on Distributed Computing (DISC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 356, pp. 55:1-55:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.DISC.2025.55

Author Details

Panagiota Fatourou
  • Department of Computer Science, University of Crete, Heraklion, Greece
  • FORTH ICS, Heraklion, Greece
Eric Ruppert
  • York University, Toronto, Canada
Ioannis Xiradakis
  • Department of Computer Science, University of Crete, Heraklion, Greece
  • FORTH ICS, Heraklion, Greece

Funding

Panagiota Fatourou and Ioannis Xiradakis: Greek Ministry of Education, Religious Affairs and Sports through the HARSH project (project no. YΠ3TA - 0560901), within the framework of the National Recovery and Resilience Plan-Greece 2.0-with funding from the European Union-NextGenerationEU.
  • Ruppert, Eric: Natural Sciences and Engineering Research Council of Canada.

References

  1. D. P. Bertsekas, F. Guerriero, and R. Musmanno. Parallel asynchronous label-correcting methods for shortest paths. Journal of Optimization Theory and Applications, 88(2):297-320, February 1996. URL: https://doi.org/10.1007/BF02192173.
  2. Joan Boyar, Rolf Fagerberg, and Kim S. Larsen. Amortization results for chromatic search trees, with an application to priority queues. Journal of Computer and System Sciences, 55(3):504-521, 1997. URL: https://doi.org/10.1006/jcss.1997.1511.
  3. Anastasia Braginsky, Nachshon Cohen, and Erez Petrank. CBPQ: high performance lock-free priority queue. In Proc. 22nd International Conference on Parallel and Distributed Computing, volume 9833 of LNCS, pages 460-474. Springer, 2016. URL: https://doi.org/10.1007/978-3-319-43659-3_34.
  4. Trevor Brown, Faith Ellen, and Eric Ruppert. A general technique for non-blocking trees. In Proc. 19th ACM Symposium on Principles and Practice of Parallel Programming, pages 329-342, 2014. URL: https://doi.org/10.1145/2555243.2555267.
  5. Kyun-Rak Chong and Sartaj Sahni. Correspondence-based data structures for double-ended priority queues. ACM J. Exp. Algorithmics, 5, December 2000. URL: https://doi.org/10.1145/351827.351828.
  6. Travis S. Craig. Building FIFO and priority-queuing spin locks from atomic swap. Technical Report 93-02-02, Department of Computer Science and Engineering, University of Washington, 1993. Google Scholar
  7. Kristijan Dragičević and Daniel Bauer. A survey of concurrent priority queue algorithms. In Proc. 22nd IEEE International Symposium on Parallel and Distributed Processing, pages 1-6. IEEE, 2008. URL: https://doi.org/10.1109/IPDPS.2008.4536331.
  8. Faith Ellen, Panagiota Fatourou, Eric Ruppert, and Franck van Breugel. Non-blocking binary search trees. In Proc. 29th ACM Symposium on Principles of Distributed Computing, pages 131-140, 2010. URL: https://doi.org/10.1145/1835698.1835736.
  9. P. Fatourou and P. Papadogiannakis. Double-ended queues based on software combining. Manuscript, 2025. Google Scholar
  10. Panagiota Fatourou and Nikolaos D. Kallimanis. Revisiting the combining synchronization technique. In Proc. 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 257-266, 2012. URL: https://doi.org/10.1145/2145816.2145849.
  11. Panagiota Fatourou, Eric Ruppert, and Ioannis Xiradakis. Concurrent double-ended priority queues. CoRR, abs/2508.13399, 2025. URL: https://arxiv.org/abs/2508.13399.
  12. James R. Goodman, Mary K. Vernon, and Philip J. Woest. Efficient synchronization primitives for large-scale cache-coherent multiprocessors. In Proc. 3rd International Conference on Architectural Support for Programming Languages and Operating Systems, pages 64-75, April 1989. URL: https://doi.org/10.1145/70082.68188.
  13. O. Grimes, A. Hassan, P. Fatourou, and R. Palmieri. PIPQ: A strict insert-optimized concurrent priority queue. In Proc. 39th International Symposium on Principles of Distributed Computing, 2025. Google Scholar
  14. Danny Hendler, Itai Incze, Nir Shavit, and Moran Tzafrir. Flat combining and the synchronization-parallelism tradeoff. In Proc. 22nd ACM Symposium on Parallelism in Algorithms and Architectures, pages 355-364, 2010. URL: https://doi.org/10.1145/1810479.1810540.
  15. Maurice P. Herlihy and Jeannette M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, July 1990. URL: https://doi.org/10.1145/78969.78972.
  16. Kenneth D. Hoover and Yuanhao Wei. A fast single-extractor wait-free priority queue. Manuscript. A brief overview in the Review of Undergraduate Computer Science is available from https://rucs-uoft.github.io/theory-of-computation/a-fast-single-extractor-wait-free-priority-queue, 2017.
  17. Qin Huang and W.E. Weihl. An evaluation of concurrent priority queue algorithms. In Proc. 3rd IEEE Symposium on Parallel and Distributed Processing, pages 518-525, 1991. URL: https://doi.org/10.1109/SPDP.1991.218255.
  18. Theodore Johnson. A highly concurrent priority queue. J. Parallel Distributed Comput., 22(2):367-373, 1994. URL: https://doi.org/10.1006/JPDC.1994.1097.
  19. Douglas W. Jones. Concurrent simulation: an alternative to distributed simulation. In Proc. 18th Winter Simulation Conference, pages 417-423. ACM, 1986. URL: https://doi.org/10.1145/318242.318468.
  20. Donald E. Knuth. The Art of Computer Programming, volume 3. Addison Wesley Longman, third edition, 1998. Google Scholar
  21. Jonatan Lindén and Bengt Jonsson. A skiplist-based concurrent priority queue with minimal memory contention. In Proc. 17th International Conference on Principles of Distributed Systems, volume 8304 of LNCS, pages 206-220. Springer, 2013. URL: https://doi.org/10.1007/978-3-319-03850-6_15.
  22. Yujie Liu and Michael F. Spear. Mounds: Array-based concurrent priority queues. In Proc. 41st International Conference on Parallel Processing, pages 1-10. IEEE Computer Society, 2012. URL: https://doi.org/10.1109/ICPP.2012.42.
  23. Peter S. Magnusson, Anders Landin, and Erik Hagersten. Queue locks on cache coherent multiprocessors. In Proc. 8th International Symposium on Parallel Processing, pages 165-171, 1994. URL: https://doi.org/10.1109/IPPS.1994.288305.
  24. Muralidhar Medidi and Narsingh Deo. Parallel min-max-pair heap. In Proc. 13th IEEE International Phoenix Conference on Computers and Communications, pages 322-328, 1994. URL: https://doi.org/10.1109/PCCC.1994.504133.
  25. John M. Mellor-Crummey and Michael L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst., 9(1):21-65, 1991. URL: https://doi.org/10.1145/103727.103729.
  26. Mark Moir and Nir Shavit. Concurrent data structures. In Dinesh P. Mehta and Sartaj Sahni, editors, Handbook of Data Structures and Applications, chapter 48.8.1. Chapman and Hall/CRC, second edition, 2018. URL: https://doi.org/10.1201/9781315119335.
  27. Aravind Natarajan, Arunmoezhi Ramachandran, and Neeraj Mittal. FEAST: a lightweight lock-free concurrent binary search tree. ACM Transactions on Parallel Computing, 7(2):1-64, May 2020. URL: https://doi.org/10.1145/3391438.
  28. William Pugh. Skip lists: a probabilistic alternative to balanced trees. Communications of ACM, 33(6):668-676, 1990. URL: https://doi.org/10.1145/78973.78977.
  29. V. Nageshwara Rao and Vipin Kumar. Concurrent access of priority queues. IEEE Trans. Computers, 37(12):1657-1665, 1988. URL: https://doi.org/10.1109/12.9744.
  30. Adones Rukundo and Philippas Tsigas. TSLQueue: An efficient lock-free design for priority queues. In Proc. 27th International Conference on Parallel and Distributed Computing, volume 12820 of LNCS, pages 385-401. Springer, 2021. URL: https://doi.org/10.1007/978-3-030-85665-6_24.
  31. Sartaj Sahni. Double-ended priority queues. In Dinesh P. Mehta and Sartaj Sahni, editors, Handbook of Data Structures and Applications, chapter 8. Chapman and Hall/CRC, second edition, 2018. URL: https://doi.org/10.1201/9781315119335.
  32. Nir Shavit and Itay Lotan. Skiplist-based concurrent priority queues. In Proc. 14th International Parallel & Distributed Processing Symposium, pages 263-268. IEEE Computer Society, 2000. URL: https://doi.org/10.1109/IPDPS.2000.845994.
  33. Håkan Sundell and Philippas Tsigas. Fast and lock-free concurrent priority queues for multi-thread systems. J. Parallel Distributed Comput., 65(5):609-627, 2005. URL: https://doi.org/10.1016/J.JPDC.2004.12.005.
  34. Orr Tamir, Adam Morrison, and Noam Rinetzky. A heap-based concurrent priority queue with mutable priorities for faster parallel algorithms. In Proc. 19th International Conference on Principles of Distributed Systems, volume 46 of LIPIcs, pages 15:1-15:16, 2015. URL: https://doi.org/10.4230/LIPICS.OPODIS.2015.15.
  35. Pen-Chung Yew, Nian-Feng Tzeng, and Duncan H. Lawrie. Distributing hot-spot addressing in large-scale multiprocessors. IEEE Transactions on Computers, 36(4):388-395, 1987. URL: https://doi.org/10.1109/TC.1987.1676921.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact