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 条
  • [1] Lock-free queues
    Marginean, Petru
    DR DOBBS JOURNAL, 2008, 33 (07): : 43 - 47
  • [2] Fast and lock-free concurrent priority queues for multi-thread systems
    Sundell, H
    Tsigas, P
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2005, 65 (05) : 609 - 627
  • [3] Lock-free reference counting
    David L. Detlefs
    Paul A. Martin
    Mark Moir
    Guy L. Steele Jr.
    Distributed Computing, 2002, 15 : 255 - 271
  • [4] Lock-free collective operations
    Supalov, A
    RECENT ADVANCES IN PARALLEL VIRTUAL MACHINE AND MESSAGE PASSING INTERFACE, 2003, 2840 : 276 - 285
  • [5] Lock-free Cuckoo Hashing
    Nhan Nguyen
    Tsigas, Philippas
    2014 IEEE 34TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2014), 2014, : 627 - 636
  • [6] Lock-Free Hopscotch Hashing
    Kelly, Robert
    Pearlmutter, Barak A.
    Maguire, Phil
    SYMPOSIUM ON ALGORITHMIC PRINCIPLES OF COMPUTER SYSTEMS, APOCS, 2020, : 45 - 59
  • [7] Mostly lock-free malloc
    Dice, D
    Garthwaite, A
    ACM SIGPLAN NOTICES, 2003, 38 (02) : 269 - 280
  • [8] Lock-free reference counting
    Detlefs, DL
    Martin, PA
    Moir, M
    Steele, GL
    DISTRIBUTED COMPUTING, 2002, 15 (04) : 255 - 271
  • [9] Lock-free Transactional Vector
    Lamar, Kenneth
    Peterson, Christina
    Dechev, Damian
    PROCEEDINGS OF THE ELEVENTH INTERNATIONAL WORKSHOP ON PROGRAMMING MODELS AND APPLICATIONS FOR MULTICORES AND MANYCORES, PMAM 2020, 2020, : 51 - 60
  • [10] Lock-Free Locks Revisited
    Ben-David, Naama
    Blelloch, Guy E.
    Wei, Yuanhao
    PPOPP'22: PROCEEDINGS OF THE 27TH ACM SIGPLAN SYMPOSIUM ON PRINCIPLES AND PRACTICE OF PARALLEL PROGRAMMING, 2022, : 278 - 293