LFTHREADS A lock-free thread library

被引:0
|
作者
Gidenstam, Anders [1 ]
Papatriantafilou, Marina [2 ]
机构
[1] Max Planck Inst Informat, D-66123 Saarbrucken, Germany
[2] Chalmers Univ Technol, Comp Sci & Engn, SE-41296 Gothenburg, Sweden
关键词
lock-free; multithreading; multiprocessors; multicores; synchronization; shared memory;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
LFTHREADS is a thread library entirely based on lock-free methods, i.e. no spin-locks or similar synchronization mechanisms are employed in the implementation of the multithreading. Since lock-freedom is highly desirable in multiprocessors/multicores due to its advantages in parallelism, fault-tolerance, convoy-avoidance and more, there is an increased demand in lock-free methods in parallel applications, hence also in multiprocessor/multicore system services. This is why a lock-free multithreading library is important. To the best of our knowledge LFTHREADS is the first thread library that provides a lock-free implementation of blocking synchronization primitives for application threads. Lock-free implementation of objects with blocking semantics may sound like a contradicting goal. However, such objects have benefits: e.g. library operations that block and unblock threads on the same synchronization object can make progress in parallel while maintaining the desired thread-level semantics and without having to wait for any "slow" operations among them. Besides, as no spin-locks or similar synchronization mechanisms are employed, processors are always able to do useful work. As a consequence, applications, too, can enjoy enhanced parallelism and fault-tolerance. The synchronization in LFTHREADS is achieved by a new method, which we call responsibility hand-off (RHO), that does not need any special kernel support.
引用
下载
收藏
页码:217 / +
页数:4
相关论文
共 50 条
  • [31] 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
  • [32] 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
  • [33] Lock-free parallel dynamic programming
    Stivala, Alex
    Stuckey, Peter J.
    Garcia de la Banda, Maria
    Hermenegildo, Manuel
    Wirth, Anthony
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2010, 70 (08) : 839 - 848
  • [34] Transactional lock-free execution of lock-based programs
    Rajwar, R
    Goodman, JR
    ACM SIGPLAN NOTICES, 2002, 37 (10) : 5 - 17
  • [35] Intelligent memory: An architecture for lock-free synchronization
    Seong, N
    Jung, N
    Kim, B
    Yoon, H
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1997, E80D (04) : 441 - 447
  • [36] Lock-free Contention Adapting Search Trees
    Winblad, Kjell
    Sagonas, Konstantinos
    Jonsson, Bengt
    SPAA'18: PROCEEDINGS OF THE 30TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2018, : 121 - 132
  • [37] Lock-free deques and doubly linked lists
    Sundell, Hakan
    Tsigas, Philippas
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2008, 68 (07) : 1008 - 1020
  • [38] An optimistic approach to lock-free FIFO queues
    Ladan-Mozes, Edya
    Shavit, Nir
    DISTRIBUTED COMPUTING, 2008, 20 (05) : 323 - 341
  • [39] Lock-free parallel algorithms: An experimental study
    Cong, GJ
    Bader, D
    HIGH PERFORMANCE COMPUTING - HIPC 2004, 2004, 3296 : 516 - 527
  • [40] 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