International Conference On Principles Of Distributed Systems

OPODIS 2010: Principles of Distributed Systems pp 302-317

Cache-Aware Lock-Free Queues for Multiple Producers/Consumers and Weak Memory Consistency

  • Anders Gidenstam
  • Håkan Sundell
  • Philippas Tsigas
Conference paper

DOI: 10.1007/978-3-642-17653-1_23

Volume 6490 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Gidenstam A., Sundell H., Tsigas P. (2010) Cache-Aware Lock-Free Queues for Multiple Producers/Consumers and Weak Memory Consistency. In: Lu C., Masuzawa T., Mosbah M. (eds) Principles of Distributed Systems. OPODIS 2010. Lecture Notes in Computer Science, vol 6490. Springer, Berlin, Heidelberg

Abstract

A lock-free FIFO queue data structure is presented in this paper. The algorithm supports multiple producers and multiple consumers and weak memory models. It has been designed to be cache-aware and work directly on weak memory models. It utilizes the cache behavior in concert with lazy updates of shared data, and a dynamic lock-free memory management scheme to decrease unnecessary synchronization and increase performance. Experiments on an 8-way multi-core platform show significantly better performance for the new algorithm compared to previous fast lock-free algorithms.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Anders Gidenstam
    • 1
  • Håkan Sundell
    • 1
  • Philippas Tsigas
    • 2
  1. 1.School of Business and InformaticsUniversity of BoråsBoråsSweden
  2. 2.Department of Computer Science and EngineeringChalmers University of TechnologyGöteborgSweden