Distributed Algorithms 10th International Workshop, WDAG '96, Bologna, Italy, October 9 - 11, 1996. Proceedings

This book constitutes the refereed proceedings of the 10th International Workshop on Distributed Algorithms, WDAG '96, held in Bologna, Italy, in October 1996.
The volume presents 21 revised full papers selected from 75 submissions together with invited contributions by Butler Lampson and Domenico Ferrari. The volume reflects the transition of the area from formerly being the domain of a small research community to becoming the dominant computing paradigm and an industrial technology. Among the topics covered are all current aspects of distributed algorithms ranging from theory to applications such as distributed intelligent agents.

How to build a highly available system using consensus.- Distributed admission control algorithms for real-time communication.- Randomization and failure detection: A hybrid approach to solve Consensus.- Levels of authentication in distributed agreement.- Efficient and robust sharing of memory in message-passing systems.- Plausible clocks: Constant size logical clocks for Distributed Systems.- Abstracting communication to reason about distributed algorithms.- Simulating reliable links with unreliable links in the presence of process crashes.- A cyclic distributed garbage collector for network objects.- Incremental, distributed orphan detection and actor garbage collection using graph partitioning and euler cycles.- A framework for the analysis of non-deterministic clock synchronisation algorithms.- Optimal time broadcasting in faulty star networks.- A lower bound for Linear Interval Routing.- Topological routing schemes.- Maintaining a dynamic set of processors in a distributed system.- Collective consistency.- Planar quorums.- “?-accurate” failure detectors.- Fast, long-lived renaming improved and simplified.- A timestamp based transformation of self-stabilizing programs for distributed computing environments.- The combinatorial structure of wait-free solvable tasks.- On the robustness of h m r .- Understanding the Set Consensus Partial Order using the Borowsky-Gafni Simulation.