Brief announcement: An asymmetric flat-combining based queue algorithm

Michael Gorelik, Danny Hendler

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

We present asymmetric flat-combining, an extension of flat-combining in which the behavior of producers and consumers differs, and use it to implement a linearizable FIFO queue. Unlike a flat-combining queue where all queue operations are blocking, in our algorithm enqueue operations are wait-free. Moreover, non-combiner threads performing dequeue operations are able to share the computational load instead of just waiting. Our experimental evaluation shows that the new queue algorithm outperforms the flat combining queue and other state of the art queue implementations for most producer-consumer workloads while allowing producer threads to operate in a wait-free manner.

Original languageEnglish
Title of host publicationPODC 2013 - Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing
Pages319-321
Number of pages3
DOIs
StatePublished - 11 Sep 2013
Event2013 ACM Symposium on Principles of Distributed Computing, PODC 2013 - Montreal, QC, Canada
Duration: 22 Jul 201324 Jul 2013

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference2013 ACM Symposium on Principles of Distributed Computing, PODC 2013
Country/TerritoryCanada
CityMontreal, QC
Period22/07/1324/07/13

Keywords

  • FIFO queue
  • Flat combining
  • Shared memory

Cite this