We present a formal model that captures the subtle interaction between knowledge, action, and communication in distributed systems. We extend the standard notion of protocol by defining knowledge-based protocols, ones...
详细信息
The computational capabilities of a system of indistinguishable processors arranged on a ring in the synchronous and asynchronous model of distributed computation are analyzed. A precise characterization of the functi...
详细信息
Partition failure causes a major problem for the availability of a distributed database system. No protocol can consistently terminate all parts of a distributed transaction under all possible partitions, since some s...
详细信息
We describe a non-authenticated Byzantine Generals algorithm, with early stopping, for systems with arbitrary process failures. The algorithm presented is simpler, terminates earlier and has a lower communication comp...
In the very large multiprocessor systems and, on a gander scale, computer networks now emerging, processes are not tied to fixed processors but run on processors taken from a pool of processors. Processors are release...
详细信息
Typical concurrency control protocols for atomic actions, such as two-phase locking, perform poorly for long read-only actions. We present three new concurrency control protocols that eliminate all interference betwee...
详细信息
A general, modular technique for designing efficient leader finding algorithms in distributed, asynchronous networks is developed. This technique reduces the relatively complex problem of efficient leader finding to a...
详细信息
It was shown by Michael Rabin that a sequence of random 0-1 values ("coin tosses"), prepared and distributed by a trusted "dealer," can be used to achieve Byzantine agreement in constant expected t...
详细信息
Easy proofs are given, of the impossibility of solving several consensus problems (Byzantine agreement, weak agreement, Byzantine firing squad, approximate agreement and clock synchronization) in certain communication...
详细信息
Similarity is introduced as a model-independent characterization of symmetry. It can be used to decide when a concurrent system has a solution to the selection problem. It can also be used to compare different models ...
暂无评论