Fast consensus in networks of bounded degree
The Distributed Consensus problem involves n processors each of which holds an initial binary value. At most t of the processors may be faulty and ignore any protocol (even behaving maliciously), yet it is required that the non-faulty processors ...
Necessary and sufficient conditions for broadcast consensus protocols
We consider consensus protocols in asynchronous distributed systems that are based on broadcast communication. We show that a necessary and sufficient condition for the existence of a deterministic consensus protocol is delivery of each broadcast ...
Efficient agreement using fault diagnosis
We give an extremely simple Byzantine agreement protocol that uses O (t2) processors, min (f + 2, t + 1) rounds of communication, O (n ċ t ċ f ċ log |V|) total message bits, and O (log |V|) maximum message size, where n is the total number of processors ...
Knowledge in shared memory systems
We study the relation between knowledge and space. That is, we analyze how much shared memory space is needed in order to learn certain kinds of facts. Such results are useful tools for reasoning about shared memory systems. In addition we generalize a ...
A note on consistency in asynchronous multicaches
This note examines and contrasts the choice of finite versus infinite histories as the framework for analysing the behaviour of an asynchronous multicache scheme.
