2 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DC2021★ 2 cited
An Impossibility Result on Strong Linearizability in Message-Passing Systems
David Yu Cheng Chan, Vassos Hadzilacos, Xing Hu +1
We prove that in asynchronous message-passing systems where at most one process may crash, there is no lock-free strongly linearizable implementation of a weak object that we call…
cs.DC2021
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 -…
cs.DC2021
Differentiated nonblocking: a new progress condition and a matching queue algorithm
David Y. C. Chan, Shucheng Chi, Vassos Hadzilacos +1
In this paper, we first propose a new liveness requirement for shared objects and data structures, we then give a shared queue algorithm that satisfies this requirement and we prov…