An efficient unbounded lock-free queue for multi-core systems

M. Aldinucci, M. Danelutto, M. Torquati, P. Kilpatrick, M. Meneghin

Research output: Chapter in Book/Report/Conference proceedingOther chapter contribution

48 Citations (Scopus)

Abstract

The use of efficient synchronization mechanisms is crucial for implementing fine grained parallel programs on modern shared cache multi-core architectures. In this paper we study this problem by considering Single-Producer/Single- Consumer (SPSC) coordination using unbounded queues. A novel unbounded SPSC algorithm capable of reducing the row synchronization latency and speeding up Producer-Consumer coordination is presented. The algorithm has been extensively tested on a shared-cache multi-core platform and a sketch proof of correctness is presented. The queues proposed have been used as basic building blocks to implement the FastFlow parallel framework, which has been demonstrated to offer very good performance for fine-grain parallel applications.
Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages662-673
Number of pages12
Volume7484 LNCS
DOIs
Publication statusPublished - 01 Jan 2012

Fingerprint Dive into the research topics of 'An efficient unbounded lock-free queue for multi-core systems'. Together they form a unique fingerprint.

Cite this