Correct and Efficient Bounded FIFO Queues - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Correct and Efficient Bounded FIFO Queues


Bounded single-producer single-consumer FIFO queues are one of the simplest concurrent data-structure, and they do not require more than sequential consistency for correct operation. Still, sequential consistency is an unrealistic hypothesis on shared-memory multiprocessors, and enforcing it through memory barriers induces significant performance and energy overhead. This paper revisits the optimization and correctness proof of bounded FIFO queues in the context of weak memory consistency, building upon the recent axiomatic formalization of the C11 memory model. We validate the portability and performance of our proven implementation over 3 processor architectures with diverse hardware memory models, including ARM and PowerPC. Comparison with state-of-the-art implementations demonstrate consistent improvements for a wide range of buffer and batch sizes.
Fichier principal
Vignette du fichier
sbac13.pdf (591.07 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00911893 , version 1 (01-12-2013)


  • HAL Id : hal-00911893 , version 1


Nhat Minh Lê, Adrien Guatto, Albert Cohen, Antoniu Pop. Correct and Efficient Bounded FIFO Queues. SBAC-PAD 2013 : International Symposium on Computer Architecture and High Performance Computing, Oct 2013, Porto de Galinhas, Brazil. ⟨hal-00911893⟩
208 View
556 Download


Gmail Facebook Twitter LinkedIn More