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

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

doi:10.1007/978-3-642-32820-6_65

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 proceeding › Other chapter contribution

59 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 language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages	662-673
Number of pages	12
Volume	7484 LNCS
DOIs	https://doi.org/10.1007/978-3-642-32820-6_65
Publication status	Published - 01 Jan 2012

Access to Document

10.1007/978-3-642-32820-6_65

Cite this

@inbook{b351a7240dbd435b863bf9217ab0bb8a,

title = "An efficient unbounded lock-free queue for multi-core systems",

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.",

author = "M. Aldinucci and M. Danelutto and M. Torquati and P. Kilpatrick and M. Meneghin",

year = "2012",

month = jan,

day = "1",

doi = "10.1007/978-3-642-32820-6_65",

language = "English",

volume = "7484 LNCS",

pages = "662--673",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

An efficient unbounded lock-free queue for multi-core systems. / Aldinucci, M.; Danelutto, M.; Torquati, M. et al.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7484 LNCS 2012. p. 662-673.

Research output: Chapter in Book/Report/Conference proceeding › Other chapter contribution

TY - CHAP

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

AU - Aldinucci, M.

AU - Danelutto, M.

AU - Torquati, M.

AU - Kilpatrick, P.

AU - Meneghin, M.

PY - 2012/1/1

Y1 - 2012/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?partnerID=yv4JPVwI&eid=2-s2.0-84867629962&md5=fb700eafd91a7340e06745d3fc7b48bf

U2 - 10.1007/978-3-642-32820-6_65

DO - 10.1007/978-3-642-32820-6_65

M3 - Other chapter contribution

AN - SCOPUS:84867629962

VL - 7484 LNCS

SP - 662

EP - 673

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this