ff:spsc:europar:12 (In proceedings)
|
Author(s) | Marco Aldinucci, Marco Danelutto, Peter Kilpatrick, Massimiliano Meneghin and Massimo Torquati |
Title | « An Efficient Unbounded Lock-Free Queue for Multi-core Systems » |
In | Proc. of 18th Intl. Euro-Par 2012 Parallel Processing |
Series | LNCS |
Volume | 7484 |
Page(s) | 662-673 |
Year | 2012 |
Publisher | Springer |
Address | Rhodes Island, Greece |
URL | http://calvados.di.unipi.it/storage/paper_files/2012_spsc_europar.pdf |
Abstract & Keywords |
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.
Keywords: fastflow
|
@inproceedings{ff:spsc:europar:12,
volume = {7484},
month = aug,
author = {Marco Aldinucci and Marco Danelutto and Peter Kilpatrick and
Massimiliano Meneghin and Massimo Torquati},
series = {LNCS},
keywords = {fastflow},
booktitle = {Proc. of 18th Intl. Euro-Par 2012 Parallel Processing},
url = {http://calvados.di.unipi.it/storage/paper_files/2012_spsc_europar.pdf},
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.},
address = {Rhodes Island, Greece},
publisher = {Springer},
year = {2012},
pages = {662-673},
}
This document was generated by bib2html 3.3.
(Modified by Luca Paolini, under the GNU General Public License)