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 条

[11] BQ: A Lock-Free Queue with Batching
Milman, Gal
Kogan, Alex
Lev, Yossi
Luchangco, Victor
Petrank, Erez
SPAA'18: PROCEEDINGS OF THE 30TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2018, : 99 - 109
[12] A lock-free multi-processing session persistence mechanism for load balancing in multi-core environment
Wu, He-Sheng
Wang, Chong-Jun
Xie, Jun-Yuan
Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, 2013, 35 (04): : 982 - 987
[13] Proposal and evaluation of mutual exclusion method using lock-free algorism for embedded systems using multi-core processor
Fujimoto K.
Oidate S.
Yabuta Y.
Takahashi A.
Yamasaki T.
Nankaku S.
Noborio H.
IEEJ Transactions on Electronics, Information and Systems, 2019, 139 (07) : 802 - 811
[14] A Lock-Free, Array-Based Priority Queue
Liu, Yujie
Spear, Michael
ACM SIGPLAN NOTICES, 2012, 47 (08) : 323 - 324
[15] Modeling Energy Consumption of Lock-Free Queue Implementations
Atalar, Aras
Gidenstam, Anders
Renaud-Goud, Paul
Tsigas, Philippas
2015 IEEE 29TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2015, : 229 - 238
[16] POSTER: Boost Lock-free Queue and Stack with Batching
Li, Ao
Li, Wenhai
Chen, Yuan
Deng, Lingfeng
PROCEEDINGS OF THE 2025 THE 30TH ACM SIGPLAN ANNUAL SYMPOSIUM ON PRINCIPLES AND PRACTICE OF PARALLEL PROGRAMMING, PPOPP 2025, 2025, : 548 - 550
[17] Formal verification of a practical lock-free queue algorithm
Doherty, S
Groves, L
Luchangco, V
Moir, M
FORMAL TECHNIQUES FOR NETWORKED AND DISTRIBUTED SYSTEMS - FORTE 2004, PROCEEDINGS, 2004, 3235 : 97 - 114
[18] CBPQ: High Performance Lock-Free Priority Queue
Braginsky, Anastasia
Cohen, Nachshon
Petrank, Erez
EURO-PAR 2016: PARALLEL PROCESSING, 2016, 9833 : 460 - 474
[19] FastForward for Efficient Pipeline Parallelism A Cache-Optimized Concurrent Lock-Free Queue
Giacomoni, John
Moseley, Tipp
Vachharajani, Manish
PPOPP'08: PROCEEDINGS OF THE 2008 ACM SIGPLAN SYMPOSIUM ON PRINCIPLES AND PRACTICE OF PARALLEL PROGRAMMING, 2008, : 43 - 52
[20] A Lock-Free Priority Queue Design Based on Multi-Dimensional Linked Lists
Zhang, Deli
Dechev, Damian
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2016, 27 (03) : 613 - 626

← 1 2 3 4 5 →