4 citations · 11 across the 9 of their papers we have counts for
11 papers
Generalized Compare-and-Swap and Space-Efficient Universal Constructions for the Infinite-Arrival Model
Vassos Hadzilacos, Myles Thiessen, Sam Toueg
We introduce GCAS, a natural generalization of the well-known compare-and-swap (CAS) object. Intuitively, GCAS just replaces the fixed equality test of CAS with a parametrized comp…
You can lie but not deny: SWMR registers with signature properties in systems with Byzantine processes
Xing Hu, Sam Toueg
We define and show how to implement SWMR registers that provide properties of unforgeable digital signatures - without actually using such signatures - in systems with Byzantine pr…
Generalized Compare and Swap
Vassos Hadzilacos, Myles Thiessen, Sam Toueg
In this paper, we first propose a natural generalization of the well-known compare-and-swap object, one that replaces the equality comparison with an arbitrary comparator. We then…
On implementing SWMR registers from SWSR registers in systems with Byzantine failures
Xing Hu, Sam Toueg
The implementation of registers from (potentially) weaker registers is a classical problem in the theory of distributed computing. Since Lamport's pioneering work [13], this proble…
Parameterized algorithm for replicated objects with local reads
Changyu Bi, Vassos Hadzilacos, Sam Toueg
We consider the problem of implementing linearizable objects that support both read and read-modify-write (RMW) operations in message-passing systems with process crashes. Since in…
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…
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…
On Register Linearizability and Termination
Vassos Hadzilacos, Xing Hu, Sam Toueg
In a seminal work, Golab et al. showed that a randomized algorithm that works with atomic objects may lose some of its properties if we replace the atomic objects that it uses with…
On Linearizability and the Termination of Randomized Algorithms
Vassos Hadzilacos, Xing Hu, Sam Toueg
We study the question of whether the "termination with probability 1" property of a randomized algorithm is preserved when one replaces the atomic registers that the algorithm uses…
Randomized Consensus with Regular Registers
Vassos Hadzilacos, Xing Hu, Sam Toueg
The well-known randomized consensus algorithm by Aspnes and Herlihy for asynchronous shared-memory systems was proved to work, even against a strong adversary, under the assumption…
On Atomic Registers and Randomized Consensus in M&M Systems
Vassos Hadzilacos, Xing Hu, Sam Toueg
Motivated by recent distributed systems technology, Aguilera et al. introduced a hybrid model of distributed computing, called message-and-memory model or m&m model for short [1].…