Search Results - "Hadzilacos, Vassos"

On atomic registers and randomized consensus in M&M systems by Hadzilacos, Vassos, Hu, Xing, Toueg, Sam

“…Motivated by recent distributed systems technology, Aguilera et al. introduced a hybrid model of distributed computing, called the message-and-memory model or…”
Get full text

Life beyond set agreement by Chan, David Yu Cheng, Hadzilacos, Vassos, Toueg, Sam

“…The set agreement power of a shared object O describes O ’s ability to solve set agreement problems: it is the sequence  ( n 1 , n 2 , … , n k , … ) such that,…”
Get full text

Randomized consensus with regular registers by Hadzilacos, Vassos, Hu, Xing, Toueg, Sam

“…•The randomized consensus algorithm of Aspnes and Herlihy, which was shown to work with atomic registers, works even with regular registers.•This result shows…”
Get full text

RMR-efficient implementations of comparison primitives using read and write operations by Golab, Wojciech, Hadzilacos, Vassos, Hendler, Danny, Woelfel, Philipp

“…We consider asynchronous multiprocessors where processes communicate only by reading or writing shared memory. We show how to implement consensus,…”
Get full text

Generalized Compare and Swap by Hadzilacos, Vassos, Thiessen, Myles, Toueg, Sam

“…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…”
Get full text

Parameterized algorithm for replicated objects with local reads by Bi, Changyu, Hadzilacos, Vassos, Toueg, Sam

“…We consider the problem of implementing linearizable objects that support both read and read-modify-write (RMW) operations in message-passing systems with…”
Get full text

On Register Linearizability and Termination by Hadzilacos, Vassos, Hu, Xing, Toueg, Sam

“…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…”
Get full text

On Linearizability and the Termination of Randomized Algorithms by Hadzilacos, Vassos, Hu, Xing, Toueg, Sam

“…We study the question of whether the "termination with probability 1" property of a randomized algorithm is preserved when one replaces the atomic registers…”
Get full text

The weakest failure detector to solve nonuniform consensus by Eisler, Jonathan, Hadzilacos, Vassos, Toueg, Sam

“…We determine the weakest failure detector to solve nonuniform consensus in any environment, i.e., regardless of the number of faulty processes. Together with…”
Get full text

Randomized Consensus with Regular Registers by Hadzilacos, Vassos, Hu, Xing, Toueg, Sam

“…The well-known randomized consensus algorithm by Aspnes and Herlihy for asynchronous shared-memory systems was proved to work, even against a strong adversary,…”
Get full text

An Impossibility Result on Strong Linearizability in Message-Passing Systems by Chan, David Yu Cheng, Hadzilacos, Vassos, Hu, Xing, Toueg, Sam

“…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…”
Get full text

Differentiated nonblocking: a new progress condition and a matching queue algorithm by Chan, David Y. C, Chi, Shucheng, Hadzilacos, Vassos, Toueg, Sam

“…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…”
Get full text

On Atomic Registers and Randomized Consensus in M&M Systems by Hadzilacos, Vassos, Hu, Xing, Toueg, Sam

“…Motivated by recent distributed systems technology, Aguilera et al. introduced a hybrid model of distributed computing, called message-and-memory model or m&m…”
Get full text

Introduction by Hadzilacos, Vassos

Get full text

Safe Locking Policies for Dynamic Databases by Chaudhri, Vinay K., Hadzilacos, Vassos

“…Yannakakis showed that a locking policy is not safe if and only if it allows a canonical nonserializable schedule of transactions in which all transactions…”
Get full text

On the power of shared object types to implement one-resilient Consensus by Lo, Wai-Kau, Hadzilacos, Vassos

“…In this paper we study the ability of shared object types to implement Consensus in asynchronous shared-memory systems where at most one process may crash…”
Get full text

ISSUES OF FAULT TOLERANCE IN CONCURRENT COMPUTATIONS (DATABASES, RELIABILITY, TRANSACTIONS, AGREEMENT PROTOCOLS, DISTRIBUTED COMPUTING) by HADZILACOS, VASSOS

“…This thesis consists of two parts, each addressing a topic in fault tolerance of concurrent computations. The first part presents a theory of reliability for…”
Get full text

Message-optimal protocols for Byzantine Agreement by Hadzilacos, Vassos, Halpern, Joseph Y.

Get full text

Connectivity requirements for Byzantine agreement under restricted types of failures by HADZILACOS, V

Get full text

The Failure Discovery problem by Hadzilacos, Vassos, Halpern, Joseph Y.

Get full text