An Almost Tight RMR Lower Bound for Abortable Test-And-Set

05/13/2018
by   Aryaz Eghbali, et al.
0

We prove a lower bound of Omega(log n/loglog n) for the remote memory reference (RMR) complexity of abortable test-and-set (leader election) in the cache-coherent (CC) and the distributed shared memory (DSM) model. This separates the complexities of abortable and non-abortable test-and-set, as the latter has constant RMR complexity (Golab, Hendler, Woelfel, SIAM Journal of Computing Vol. 39, 2010). Golab, Hendler, Hadzilacos and Woelfel (Distributed Computing Vol. 25, 2012) showed that compare-and-swap can be implemented from registers and TAS objects with constant RMR complexity. We observe that a small modification to that implementation is abortable, provided that the used TAS objects are abortable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/11/2023

The Space Complexity of Consensus from Swap

Nearly thirty years ago, it was shown that Ω(√(n)) registers are needed ...
research
02/11/2019

Efficient Randomized Test-And-Set Implementations

We study randomized test-and-set (TAS) implementations from registers in...
research
02/26/2020

Quantum Distributed Complexity of Set Disjointness on a Line

Given x,y∈{0,1}^n, Set Disjointness consists in deciding whether x_i=y_i...
research
02/19/2019

A Tight Lower Bound for Index Erasure

The Index Erasure problem asks a quantum computer to prepare a uniform s...
research
06/06/2021

Tight Lower Bounds for the RMR Complexity of Recoverable Mutual Exclusion

We present a tight RMR complexity lower bound for the recoverable mutual...
research
03/06/2023

The Complexity of Geodesic Spanners

A geometric t-spanner for a set S of n point sites is an edge-weighted g...
research
04/03/2019

Recoverable Mutual Exclusion with Sub-logarithmic RMR Complexity on CC and DSM machines

In light of recent advances in non-volatile main memory technology, Gola...

Please sign up or login with your details

Forgot password? Click here to reset