Recoverable mutual exclusion
W Golab, A Ramaraju - Proceedings of the 2016 ACM Symposium on …, 2016 - dl.acm.org
Mutex locks have traditionally been the most common mechanism for protecting shared data
structures in parallel programs. However, the robustness of such locks against process …
structures in parallel programs. However, the robustness of such locks against process …
Sample-optimal Fourier sampling in any constant dimension
P Indyk, M Kapralov - 2014 IEEE 55th Annual Symposium on …, 2014 - ieeexplore.ieee.org
We give an algorithm for ℓ 2/ℓ 2 sparse recovery from Fourier measurements using O (k log
N) samples, matching the lower bound of Do Ba-Indyk-Price-Woodruff'10 for non-adaptive …
N) samples, matching the lower bound of Do Ba-Indyk-Price-Woodruff'10 for non-adaptive …
Recoverable mutual exclusion in sub-logarithmic time
Recoverable mutual exclusion (RME) is a variation on the classic mutual exclusion (ME)
problem that allows processes to crash and recover. The time complexity of RME algorithms …
problem that allows processes to crash and recover. The time complexity of RME algorithms …
Recoverable mutual exclusion under system-wide failures
Recoverable mutual exclusion (RME) is a variation on the classic mutual exclusion (ME)
problem that allows processes to crash and recover. The time complexity of RME algorithms …
problem that allows processes to crash and recover. The time complexity of RME algorithms …
Randomized abortable mutual exclusion with constant amortized RMR complexity on the CC model
G Giakkoupis, P Woelfel - Proceedings of the ACM Symposium on …, 2017 - dl.acm.org
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 …
atomic registers and CAS objects. The algorithm has constant expected amortized RMR …
RMR-efficient randomized abortable mutual exclusion
A Pareek, P Woelfel - International Symposium on Distributed Computing, 2012 - Springer
Recent research on mutual exclusion for shared-memory systems has focused on local spin
algorithms. Performance is measured using the remote memory references (RMRs) metric …
algorithms. Performance is measured using the remote memory references (RMRs) metric …
Fast and fair randomized wait-free locks
N Ben-David, GE Blelloch - Proceedings of the 2022 ACM Symposium …, 2022 - dl.acm.org
We present a randomized approach for wait-free locks with strong bounds on time and
fairness in a context in which any process can be arbitrarily delayed. Our approach supports …
fairness in a context in which any process can be arbitrarily delayed. Our approach supports …
Deterministic abortable mutual exclusion with sublogarithmic adaptive rmr complexity
A Alon, A Morrison - Proceedings of the 2018 ACM Symposium on …, 2018 - dl.acm.org
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 …
model with read, write, Fetch-And-Add (F&A), and CAS primitives, whose RMR complexity is …
Randomized mutual exclusion with constant amortized RMR complexity on the DSM
G Giakkoupis, P Woelfel - 2014 IEEE 55th Annual Symposium …, 2014 - ieeexplore.ieee.org
In this paper we settle an open question by determining the remote memory reference
(RMR) complexity of randomized mutual exclusion, on the distributed shared memory model …
(RMR) complexity of randomized mutual exclusion, on the distributed shared memory model …
Test-and-set in optimal space
G Giakkoupis, M Helmi, L Higham… - Proceedings of the forty …, 2015 - dl.acm.org
The test-and-set object is a fundamental synchronization primitive for shared memory
systems. This paper addresses the number of registers (supporting atomic reads and writes) …
systems. This paper addresses the number of registers (supporting atomic reads and writes) …