Cache-Aware Lock-Free Queues for Multiple Producers/Consumers and Weak Memory Consistency
Paper in proceeding, 2010

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.

Concurrent Data Structures




weak memory models


Anders Gidenstam

University of Borås

Håkan Sundell

University of Borås

Philippas Tsigas

Chalmers, Computer Science and Engineering (Chalmers), Networks and Systems (Chalmers)

PRINCIPLES OF DISTRIBUTED SYSTEMS, Lecture Notes in Computer Science

1611-3349 (eISSN)

Vol. 6490 302-317

Areas of Advance

Information and Communication Technology


Basic sciences

Subject Categories

Software Engineering

Computer Science



More information

Latest update

9/4/2020 1