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 条
  • [41] Lock-free Hash Table on Graphics Processors
    Moazeni, Maryam
    Sarrafzadeh, Majid
    2012 SYMPOSIUM ON APPLICATION ACCELERATORS IN HIGH PERFORMANCE COMPUTING (SAAHPC), 2012, : 133 - 136
  • [42] An optimistic approach to lock-free FIFO queues
    Ladan-Mozes, E
    Shavit, N
    DISTRIBUTED COMPUTING, PROCEEDINGS, 2004, 3274 : 117 - 131
  • [43] Lock-free Computation of PageRank in Dynamic Graphs
    Sahu, Subhajit
    Kothapalli, Kishore
    Eedi, Hemalatha
    Peri, Sathya
    2024 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS, IPDPSW 2024, 2024, : 825 - 834
  • [44] Verified Lock-Free Session Channels with Linking
    Somers, Thomas
    Krebbers, Robbert
    Proceedings of the ACM on Programming Languages, 2024, 8 (OOPSLA2)
  • [45] Derivation of a Scalable Lock-Free Stack Algorithm
    Groves, Lindsay
    Colvin, Robert
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2007, 187 : 55 - 74
  • [46] NBmalloc: Allocating Memory in a Lock-Free Manner
    Anders Gidenstam
    Marina Papatriantafilou
    Philippas Tsigas
    Algorithmica, 2010, 58 : 304 - 338
  • [47] Scalable lock-free dynamic memory allocation
    Michael, MM
    ACM SIGPLAN NOTICES, 2004, 39 (06) : 35 - 46
  • [48] 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
  • [49] An optimistic approach to lock-free FIFO queues
    Edya Ladan-Mozes
    Nir Shavit
    Distributed Computing, 2008, 20 : 323 - 341
  • [50] Scalable Lock-Free Dynamic Memory Allocation
    Michael, Maged M.
    ACM SIGPLAN NOTICES, 2015, 50 (08) : 11 - 22