4 citations · 7 across the 13 of their papers we have counts for
17 papers
Efficient Randomized LL/SC that Preserves History Independence
Dante Bencivenga, Homa Habashi, Philipp Woelfel
We study the fundamental problem of implementing linearizable LL/SC objects with constant expected step complexity in a system of processes, using bounded base objects comm…
Tight Lower Bounds for the RMR Complexity of Recoverable Mutual Exclusion
David Yu Cheng Chan, Philipp Woelfel
We present a tight RMR complexity lower bound for the recoverable mutual exclusion (RME) problem, defined by Golab and Ramaraju \cite{GR2019a}. In particular, we show that any -…
Strongly Linearizable Implementations of Snapshots and Other Types
Sean Ovens, Philipp Woelfel
Linearizability is the gold standard of correctness conditions for shared memory algorithms, and historically has been considered the practical equivalent of atomicity. However, it…
Efficient Randomized Test-And-Set Implementations
George Giakkoupis, Philipp Woelfel
We study randomized test-and-set (TAS) implementations from registers in the asynchronous shared memory model with n processes. We introduce the problem of group election, a natura…
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion
Zahra Aghazadeh, Damien Imbs, Michel Raynal +2
The notion of an anonymous shared memory (recently introduced in PODC 2017) considers that processes use different names for the same memory location. Hence, there is permanent dis…
An Almost Tight RMR Lower Bound for Abortable Test-And-Set
Aryaz Eghbali, Philipp Woelfel
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 dist…