TY - GEN

T1 - Deterministic abortable mutual exclusion with sublogarithmic adaptive RMR complexity

AU - Alon, Adam

AU - Morrison, Adam

N1 - Publisher Copyright: © 2018 Copyright held by the owner/author(s). Publication rights licensed to ACM.

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 - https://doi.org/10.1145/3212734.3212759

DO - https://doi.org/10.1145/3212734.3212759

M3 - منشور من مؤتمر

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

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

Y2 - 23 July 2018 through 27 July 2018

ER -