Speculative Read Write Locks

被引:2
|
作者
Issa, Shady [1 ]
Romano, Paolo [1 ]
Lopes, Tiago [1 ]
机构
[1] Univ Lisbon, Inst Super Tecn, INESC ID, Lisbon, Portugal
来源
MIDDLEWARE'18: PROCEEDINGS OF THE 2018 ACM/IFIP/USENIX MIDDLEWARE CONFERENCE | 2018年
关键词
SYNCHRONIZATION;
D O I
10.1145/3274808.3274825
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Hardware Transactional Memory (HTM) has recently entered the realm of mainstream computing thanks to its integration in processors commercialized by major industrial manufacturers. HTM provides highly-efficient, hardware-assisted synchronization mechanisms for concurrent programs. Unfortunately, though, existing HTM implementations also suffer from severe limitations that are inherently related to their best-effort, hardware-based design. This work introduces SpRWL (Speculative Read Write Lock), a HTM-based implementation of read-write locks that provides a key benefit: allowing readers to execute outside the scope of hardware transactions, thus, effectively sparing them from any HTM-related limitation. SpRWL is the first HTM-based read-write lock implementation to support the concurrent execution of uninstrumented readers, while assuming a standard transaction demarcation API that is universally supported by any HTM implementation. Via an extensive experimental study, we show that SpRWL can achieve striking performance gains (up to 16x) with respect to state of the art read-write lock implementations based not only on pessimistic/lock-based schemes, but also on HTM-based techniques that exploit specific hardware mechanisms currently supported solely by a restricted number of architectures.
引用
收藏
页码:214 / 226
页数:13
相关论文
共 50 条
  • [11] Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks
    Jayanti, Prasad
    Liu, Zhiyu
    DISTRIBUTED COMPUTING, DISC 2012, 2012, 7611 : 282 - 296
  • [12] Simple and Fast Biased Locks
    Vasudevan, Nalini
    Namjoshi, Kedar S.
    Edwards, Stephen A.
    PACT 2010: PROCEEDINGS OF THE NINETEENTH INTERNATIONAL CONFERENCE ON PARALLEL ARCHITECTURES AND COMPILATION TECHNIQUES, 2010, : 65 - 73
  • [13] On Spin Locks in AUTOSAR: Blocking Analysis of FIFO, Unordered, and Priority-Ordered Spin Locks
    Wieder, Alexander
    Brandenburg, Bjoern B.
    IEEE 34TH REAL-TIME SYSTEMS SYMPOSIUM (RTSS 2013), 2013, : 45 - 56
  • [14] Harmonizing Speculative and Non-Speculative Execution in Architectures for Ordered Parallelism
    Jeffrey, Mark C.
    Ying, Victor A.
    Subramanian, Suvinay
    Lee, Hyun Ryong
    Emer, Joel
    Sanchez, Daniel
    2018 51ST ANNUAL IEEE/ACM INTERNATIONAL SYMPOSIUM ON MICROARCHITECTURE (MICRO), 2018, : 217 - 230
  • [15] Protecting Locks Against Unbalanced Unlock()
    Shahare, Vivek
    Chabbi, Milind
    Hegde, Nikhil
    PROCEEDINGS OF THE 35TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2023, 2023, : 199 - 211
  • [16] Scalable Reader-Writer Locks
    Lev, Yossi
    Luchangco, Victor
    Olszewski, Marek
    SPAA'09: PROCEEDINGS OF THE TWENTY-FIRST ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2009, : 101 - 110
  • [17] Compact NUMA-aware Locks
    Dice, Dave
    Kogan, Alex
    PROCEEDINGS OF THE FOURTEENTH EUROSYS CONFERENCE 2019 (EUROSYS '19), 2019,
  • [18] TWA - Ticket Locks Augmented with a Waiting Array
    Dice, Dave
    Kogan, Alex
    EURO-PAR 2019: PARALLEL PROCESSING, 2019, 11725 : 334 - 345
  • [19] A Preliminary Study of Minimal-Contention Locks
    Machanick, Philip
    PROCEEDINGS OF THE ANNUAL CONFERENCE OF THE SOUTH AFRICAN INSTITUTE OF COMPUTER SCIENTISTS AND INFORMATION TECHNOLOGISTS (SAICSIT 2018), 2018, : 269 - 278
  • [20] Inferential Queueing and Speculative Push
    Ravi Rajwar
    Alain Kägi
    James R Goodman
    International Journal of Parallel Programming, 2004, 32 : 225 - 258