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
来源
关键词
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 条
  • [21] Efficient Lock-Free Durable Sets
    Zuriel, Yoav
    Friedman, Michal
    Sheffi, Gali
    Cohen, Nachshon
    Petrank, Erez
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2019, 3 (OOPSLA):
  • [22] Persistent Lock-Free Queue for Non-Volatile Memory
    Friedman, Michal
    Herlihy, Maurice
    Marathe, Virendra
    Petrank, Erez
    ACM SIGPLAN NOTICES, 2018, 53 (01) : 28 - 40
  • [23] Lock-free stack and queue: Java']Java vs .NET
    Botincan, Matko
    Runje, Davor
    PROCEEDINGS OF THE ITI 2007 29TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY INTERFACES, 2007, : 741 - +
  • [24] Trace-based Derivation of a Lock-Free Queue Algorithm
    Groves, Lindsay
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2008, 201 (0C) : 69 - 98
  • [25] A Conflict-Resilient Lock-Free Linearizable Calendar Queue
    Marotta, Romolo
    Ianni, Mauro
    Pellegrini, Alessandro
    Quaglia, Francesco
    ACM TRANSACTIONS ON PARALLEL COMPUTING, 2024, 11 (01)
  • [26] Application of Lock-Free Queue in a Fast Command Relay Software
    Wang Sen
    Zhao Qi
    Feng Wen-quan
    2009 SECOND INTERNATIONAL CONFERENCE ON FUTURE INFORMATION TECHNOLOGY AND MANAGEMENT ENGINEERING, FITME 2009, 2009, : 572 - 575
  • [27] The Lock-Free k-LSM Relaxed Priority Queue
    Wimmer, Martin
    Gruber, Jakob
    Traeff, Jesper Larsson
    Tsigas, Philippas
    ACM SIGPLAN NOTICES, 2015, 50 (08) : 277 - 278
  • [28] Lock-free distributed queue in remote memory access model
    Burachenko, Alexander, V
    Paznikov, Alexei A.
    Derzhavin, Denis P.
    VESTNIK TOMSKOGO GOSUDARSTVENNOGO UNIVERSITETA-UPRAVLENIE VYCHISLITELNAJA TEHNIKA I INFORMATIKA-TOMSK STATE UNIVERSITY JOURNAL OF CONTROL AND COMPUTER SCIENCE, 2023, (62): : 13 - 24
  • [29] Efficient Lock-free Binary Search Trees
    Chatterjee, Bapi
    Nguyen, Nhan
    Tsigas, Philippas
    PROCEEDINGS OF THE 2014 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'14), 2014, : 322 - 331
  • [30] On the Design and Implementation of an Efficient Lock-Free Scheduler
    Negele, Florian
    Friedrich, Felix
    Oh, Suwon
    Egger, Bernhard
    JOB SCHEDULING STRATEGIES FOR PARALLEL PROCESSING, JSSPP 2016, 2017, 10353 : 22 - 45