Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model

被引：6

作者：

Giakkoupis, George ^{[1
]}

Woelfel, Philipp ^{[2
]}

机构：

[1] INRIA, Rennes, France

[2] Univ Calgary, Calgary, AB, Canada

来源：

PROCEEDINGS OF THE ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'17) | 2017年

关键词：

Mutual exclusion; RMR complexity; shared memory; oblivious adversary; CC model; IMPLEMENTATIONS; ALGORITHMS;

D O I：

10.1145/3087801.3087837

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

We present an abortable mutual exclusion algorithm for the cache-coherent (CC) model with atomic registers and CAS objects. The algorithm has constant expected amortized RMR complexity in the oblivious adversary model and is deterministically deadlock-free. This is the first abortable mutual exclusion algorithm that achieves o(log n/log log n) RMR complexity.

引用

页码：221 / 229

页数：9

共 10 条

[1] Randomized Mutual Exclusion with Constant Amortized RMR Complexity on the DSM
Giakkoupis, George
Woelfel, Philipp
2014 55TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2014), 2014, : 504 - 513
[2] Constant Amortized RMR Abortable Mutex for CC and DSM
Jayanti, Prasad
Jayanti, Siddhartha
PROCEEDINGS OF THE 2019 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '19), 2019, : 167 - 176
[3] Deterministic Constant-Amortized-RMR Abortable Mutex for CC and DSM
Jayanti, Prasad
Jayanti, Siddhartha
ACM TRANSACTIONS ON PARALLEL COMPUTING, 2021, 8 (04)
[4] RMR-Efficient Randomized Abortable Mutual Exclusion
Pareek, Abhijeet
Woelfel, Philipp
DISTRIBUTED COMPUTING, DISC 2012, 2012, 7611 : 267 - 281
[5] Deterministic Abortable Mutual Exclusion with Sublogarithmic Adaptive RMR Complexity
Alon, Adam
Morrison, Adam
PODC'18: PROCEEDINGS OF THE 2018 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2018, : 27 - 36
[6] Randomized mutual exclusion with sub-logarithmic RMR-complexity
Danny Hendler
Philipp Woelfel
Distributed Computing, 2011, 24 : 3 - 19
[7] Randomized mutual exclusion with sub-logarithmic RMR-complexity
Hendler, Danny
Woelfel, Philipp
DISTRIBUTED COMPUTING, 2011, 24 (01) : 3 - 19
[8] A Tight RMR Lower Bound for Randomized Mutual Exclusion
Giakkoupis, George
Woelfel, Philipp
STOC'12: PROCEEDINGS OF THE 2012 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2012, : 983 - 1001
[9] Tight Lower Bounds for the RMR Complexity of Recoverable Mutual Exclusion
Chan, David Yu Cheng
Woelfel, Philipp
PROCEEDINGS OF THE 2021 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '21), 2021, : 533 - 543
[10] A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
Chen, Sheng-Hsiung
Huang, Ting-Lu
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2006, 66 (11) : 1455 - 1471

← 1 →