Distributed Algorithms 7th International Workshop, WDAG `93, Lausanne, Switzerland, September 27-29, 1993. Proceedings

This volume presents the proceedings of the Seventh International Workshop on Distributed Algorithms (WDAG 93), held in Lausanne, Switzerland, September 1993. It contains 22 papers selected from 72 submissions. The selection was based on originality, quality, and relevance to the field of distributed computing: 6 papers are from Europe, 13 from North America, and 3 from the Middle East. The papers discuss topics from all areas of distributed computing and their applications, including distributed algorithms for control and communication, fault-tolerant distributed algorithms, network protocols, algorithms for managing replicated data, protocols for real-time distributed systems, issues of asynchrony, synchrony and real-time, mechanisms for security in distributed systems, techniques for the design and analysis of distributed algorithms, distributed database techniques, distributed combinatorial and optimization algorithms, and distributed graph algorithms.

Efficient wait-free implementation of a concurrent priority queue.- Binary snapshots.- Linear-time snapshot protocols for unbalanced systems.- Towards a necessary and sufficient condition for wait-free synchronization (Extended Abstract).- Efficient algorithms for checking the atomicity of a run of read and write operations.- Benign failure models for shared memory.- Generalized agreement between concurrent fail-stop processes.- Controlling memory access concurrency in efficient fault-tolerant parallel algorithms (extended abstract).- Asynchronous epoch management in replicated databases.- Crash resilient communication in dynamic networks.- Distributed job scheduling using snapshots.- Optimal time self stabilization in dynamic systems.- Tolerating transient and permanent failures (extended abstract).- Quick atomic broadcast.- Time bounds for decision problems in the presence of timing uncertainty and failures.- Boolean Routing.- Notes on sorting and counting networks (extended abstract).- A simple, efficient algorithm for maximum finding on rings.- Wang tilings and distributed orientation on anonymous torus networks (extended abstract).- Fairness of N-party synchronization and its implementation in a distributed environment.- Programming distributed reactive systems: A strong and weak synchronous coupling.- Using message semantics to reduce rollback in the time warp mechanism.