Deterministic abortable mutual exclusion with sublogarithmic adaptive RMR complexity

Adam Alon; Adam Morrison

doi:10.1145/3212734.3212759

Deterministic abortable mutual exclusion with sublogarithmic adaptive RMR complexity

Adam Alon, Adam Morrison

School of Computer Science

Tel Aviv University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

8 Scopus citations

Abstract

We present a deterministic abortable mutual exclusion algorithm for a cache-coherent (CC) model with read, write, Fetch-And-Add (F&A), and CAS primitives, whose RMR complexity is O(log_W N ), where W is the size of the F&A registers. Under the standard assumption of W = Θ(log N ), our algorithm's RMR complexity is O(_log ^log _log ^N _N ); if W = Θ(N^ϵ ), for 0 < < 1 (as is the case in real multiprocessor machines), the RMR complexity is O(1). Our algorithm is adaptive to the number of processes that abort. In particular, if no process aborts during a passage, its RMR cost is O(1).

Original language	English
Title of host publication	PODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
Publisher	Association for Computing Machinery
Pages	27-36
Number of pages	10
ISBN (Print)	9781450357951
DOIs	https://doi.org/10.1145/3212734.3212759
State	Published - 23 Jul 2018
Event	37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2018 - Egham, United Kingdom Duration: 23 Jul 2018 → 27 Jul 2018

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference	37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2018
Country/Territory	United Kingdom
City	Egham
Period	23/07/18 → 27/07/18

Funding

Funders	Funder number
Blavatnik Family Foundation
Israel Science Foundation	2005/17

Access to Document

10.1145/3212734.3212759

Cite this

Alon, A., & Morrison, A. (2018). Deterministic abortable mutual exclusion with sublogarithmic adaptive RMR complexity. In PODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (pp. 27-36). (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing). Association for Computing Machinery. https://doi.org/10.1145/3212734.3212759

@inproceedings{f406e19c5c67479685530da22a24622d,

title = "Deterministic abortable mutual exclusion with sublogarithmic adaptive RMR complexity",

abstract = "We present a deterministic abortable mutual exclusion algorithm for a cache-coherent (CC) model with read, write, Fetch-And-Add (F&A), and CAS primitives, whose RMR complexity is O(logW N ), where W is the size of the F&A registers. Under the standard assumption of W = Θ(log N ), our algorithm's RMR complexity is O(log log log N N ); if W = Θ(Nϵ ), for 0 < < 1 (as is the case in real multiprocessor machines), the RMR complexity is O(1). Our algorithm is adaptive to the number of processes that abort. In particular, if no process aborts during a passage, its RMR cost is O(1).",

author = "Adam Alon and Adam Morrison",

note = "Publisher Copyright: {\textcopyright} 2018 Copyright held by the owner/author(s). Publication rights licensed to ACM.; 37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2018 ; Conference date: 23-07-2018 Through 27-07-2018",

year = "2018",

month = jul,

day = "23",

doi = "10.1145/3212734.3212759",

language = "אנגלית",

isbn = "9781450357951",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "Association for Computing Machinery",

pages = "27--36",

booktitle = "PODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing",

address = "ארצות הברית",

}

Alon, A & Morrison, A 2018, Deterministic abortable mutual exclusion with sublogarithmic adaptive RMR complexity. in PODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, pp. 27-36, 37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, 23/07/18. https://doi.org/10.1145/3212734.3212759

Deterministic abortable mutual exclusion with sublogarithmic adaptive RMR complexity. / Alon, Adam; Morrison, Adam.
PODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 2018. p. 27-36 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Deterministic abortable mutual exclusion with sublogarithmic adaptive RMR complexity

AU - Alon, Adam

AU - Morrison, Adam

PY - 2018/7/23

Y1 - 2018/7/23

N2 - We present a deterministic abortable mutual exclusion algorithm for a cache-coherent (CC) model with read, write, Fetch-And-Add (F&A), and CAS primitives, whose RMR complexity is O(logW N ), where W is the size of the F&A registers. Under the standard assumption of W = Θ(log N ), our algorithm's RMR complexity is O(log log log N N ); if W = Θ(Nϵ ), for 0 < < 1 (as is the case in real multiprocessor machines), the RMR complexity is O(1). Our algorithm is adaptive to the number of processes that abort. In particular, if no process aborts during a passage, its RMR cost is O(1).

AB - We present a deterministic abortable mutual exclusion algorithm for a cache-coherent (CC) model with read, write, Fetch-And-Add (F&A), and CAS primitives, whose RMR complexity is O(logW N ), where W is the size of the F&A registers. Under the standard assumption of W = Θ(log N ), our algorithm's RMR complexity is O(log log log N N ); if W = Θ(Nϵ ), for 0 < < 1 (as is the case in real multiprocessor machines), the RMR complexity is O(1). Our algorithm is adaptive to the number of processes that abort. In particular, if no process aborts during a passage, its RMR cost is O(1).

UR - http://www.scopus.com/inward/record.url?scp=85052440134&partnerID=8YFLogxK

U2 - 10.1145/3212734.3212759

DO - 10.1145/3212734.3212759

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85052440134

SN - 9781450357951

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 27

EP - 36

BT - PODC 2018 - Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing

PB - Association for Computing Machinery

T2 - 37th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2018

Y2 - 23 July 2018 through 27 July 2018

ER -

Deterministic abortable mutual exclusion with sublogarithmic adaptive RMR complexity

Abstract

Publication series

Conference

Funding

Access to Document

Other files and links

Fingerprint

Cite this