Distributed Algorithms: 9th International Workshop, WDAG ’95 Le Mont-Saint-Michel, France, September 13–15, 1995 Proceedings

Mohamed G. Gouda (auth.), Jean-Michel Hélary, Michel Raynal (eds.)3540602747, 9783540602743

This book constitutes the proceedings of the 9th International Workshop on Distributed Algorithms, WDAG ’95, held in Le Mont-Saint-Michel, France in September 1995.
Besides four invited contributions, 18 full revised research papers are presented, selected from a total of 48 submissions during a careful refereeing process. The papers document the progress achieved in the area since the predecessor workshop (LNCS 857); they are organized in sections on asynchronous systems, networks, shared memory, Byzantine failures, self-stabilization, and detection of properties.

---

Table of contents :
The triumph and tribulation of system stabilization….Pages 1-18
Wait-free computing….Pages 19-50
On real-time and non real-time distributed computing….Pages 51-70
Theory and practice in distributed systems….Pages 71-71
The inherent cost of strong-partial view-synchronous communication….Pages 72-86
Revisiting the relationship between non-blocking atomic commitment and consensus….Pages 87-100
Dissecting distributed coordination….Pages 101-115
Optimal Broadcast with Partial Knowledge….Pages 116-130
Multi-dimensional Interval Routing Schemes….Pages 131-144
Data transmission in processor networks….Pages 145-159
Distributed protocols against mobile eavesdroppers….Pages 160-167
Universal constructions for large objects….Pages 168-182
Load balancing: An exercise in constrained convergence….Pages 183-197
Larchant-RDOSS: A distributed shared persistent memory and its garbage collector….Pages 198-214
Broadcasting in hypercubes with randomly distributed Byzantine faults….Pages 215-229
On the number of authenticated rounds in Byzantine Agreement….Pages 230-241
Total ordering algorithms for asynchronous Byzantine systems….Pages 242-256
A uniform self-stabilizing minimum diameter spanning tree algorithm….Pages 257-272
Self-stabilization of wait-free shared memory objects….Pages 273-287
Deterministic, constant space, self-stabilizing leader election on uniform rings….Pages 288-302
Efficient detection of restricted classes of global predicates….Pages 303-317
Faster possibility detection by combining two approaches….Pages 318-332