An efficient algorithm for synchronized termination of iterative solution of simultaneous equations in a distributed message passing system is presented. The algorithm is based on an assumption that distributed proces...
详细信息
The proceedings contain 27 papers. The topics discussed include: easy impossibility proofs for distributed consensus problems;symmetry and similarity in distributed systems;site optimal termination protocols for a dis...
ISBN:
(纸本)0897911687
The proceedings contain 27 papers. The topics discussed include: easy impossibility proofs for distributed consensus problems;symmetry and similarity in distributed systems;site optimal termination protocols for a distributed database under network partitioning;on the analysis of cooperation and antagonism in networks of communicating processes;optimal clock synchronization;fast distributed agreement;distributed version management for read-only actions;simple constant-time consensus protocols in realistic failure models;a modular technique for the design of efficient distributed leader finding algorithms;improvements in the time complexity of two message-optimal election algorithms;time and message bounds for election in . synchronous and asynchronous complete networks;how processes learn;a provably secure polynomial approximation scheme for the distributed lottery problem;computing on an anonymous ring;cheating husbands and other stories: a case study of knowledge, action, and communication;inexact agreement: accuracy, precision, and graceful degradation;and towards a universal directory service.
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...
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...
详细信息
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...
详细信息
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...
详细信息
暂无评论