An Efficient Unbounded Lock-Free Queue for Multi-core Systems

被引：0

作者：

Aldinucci, Marco ^{[1
]}

Danelutto, Marco ^{[2
]}

Kilpatrick, Peter ^{[3
]}

Meneghin, Massimiliano ^{[4
]}

Torquati, Massimo ^{[2
]}

机构：

[1] Univ Turin, Dept Comp Sci, I-10124 Turin, Italy

[2] Univ Pisa, Dept Comp Sci, Pisa, Italy

[3] Queens Univ Belfast, Dept Comp Sci, Belfast, Antrim, North Ireland

[4] IBM Dublin Res Lab, Dublin, Ireland

来源：

EURO-PAR 2012 PARALLEL PROCESSING | 2012年 / 7484卷

关键词：

Lock-free algorithms; wait-free algorithms; bounded and unbounded SPSC queues; cache-coherent multi-cores;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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.

引用

页码：662 / 673

页数：12

共 50 条

[1] EQueue: Elastic Lock-Free FIFO Queue for Core-to-Core Communication on Multi-Core Processors
Wang, Junchang
Tian, Yangfeng
Fu, Xiong
IEEE ACCESS, 2020, 8 : 98729 - 98741
[2] Lock-Free Data Structure for Multi-core Processors
Engdahl, Jonathan R.
Chung, Dukki
INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION AND SYSTEMS (ICCAS 2010), 2010, : 984 - 989
[3] Automatic Lock-free Parallel Programming on Multi-core Processors
Chennupati, Gopinath
Azad, R. Muhammad Atif
Ryan, Conor
2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 4143 - 4150
[4] CORAL: A Multi-Core Lock-Free Rate Limiting Framework
Fu, Zhe
Liu, Zhi
Gao, Jiaqi
Zhou, Wenzhe
Xu, Wei
Li, Jun
2017 INTERNATIONAL CONFERENCE ON COMPUTING, NETWORKING AND COMMUNICATIONS (ICNC), 2016, : 638 - 642
[5] Concurrent Lock-Free Unbounded Priority Queue with Mutable Priorities
Walulya, Ivan
Chatterjee, Bapi
Datta, Ajoy K.
Niyolia, Rashmi
Tsigas, Philippas
STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2018, 2018, 11201 : 365 - 380
[6] Concurrent lock-free unbounded priority queue with mutable priorities
Walulya, Ivan
Chatterjee, Bapi
Datta, Ajoy K.
Niyolia, Rashmi
Tsigas, Philippas
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018, 11201 LNCS : 365 - 380
[7] A Memory Efficient Lock-Free Circular Queue
Miniskar, Narasinga Rao
Liu, Frank
Vetter, Jeffrey S.
2021 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2021,
[8] A Cache-Friendly Concurrent Lock-Free Queue for Efficient Inter-Core Communication
Meng, Xianghui
Zeng, Xuewen
Chen, Xiao
Ye, Xiaozhou
2017 IEEE 9TH INTERNATIONAL CONFERENCE ON COMMUNICATION SOFTWARE AND NETWORKS (ICCSN), 2017, : 538 - 542
[9] BQ: A Lock-Free Queue with Batching
Milman-Sela, Gal
Kogan, Alex
Lev, Yossi
Luchangco, Victor
Petrank, Erez
ACM TRANSACTIONS ON PARALLEL COMPUTING, 2022, 9 (01)
[10] A Portable Lock-Free Bounded Queue
Pirkelbauer, Peter
Milewicz, Reed
Felipe Gonzalez, Juan
ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2016, 2016, 10048 : 55 - 73

← 1 2 3 4 5 →