## Distributed Algorithms: 9th International Workshop, WDAG '95, Le Mont-Saint-Michel, France, September 13 - 15, 1995. ProceedingsJean-Michel Helary, Michel Raynal 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. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

The Triumph and Tribulation of System Stabilization | 1 |

Waitfree Computing | 19 |

On RealTime and Non RealTime Distributed Computing | 51 |

Theory and Practice in Distributed Systems | 71 |

The Inherent Cost of StrongPartial ViewSynchronous Communication | 72 |

Revisiting the relationship between nonblocking atomic commitment and consensus | 87 |

Dissecting Distributed Coordination | 101 |

Optimal Broadcast with Partial Knowledge Extended Abstract | 116 |

An Exercise in Constrained Convergence | 183 |

a Distributed Shared Persistent Memory and its Garbage Collector | 198 |

Broadcasting in Hypercubes with Randomly Distributed Byzantine Faults | 215 |

On the Number of Authenticated Rounds in Byzantine Agreement | 230 |

Total Ordering Algorithms for Asynchronous Byzantine Systems | 242 |

A Uniform SelfStabilizing Minimum Diameter Spanning Tree Algorithm | 257 |

SelfStabilization of WaitFree Shared Memory Objects | 273 |

Deterministic Constant Space SelfStabilizing Leader Election on Uniform Rings | 288 |

MultiDimensional Interval Routing Schemes | 131 |

Data Transmission in Processor Networks | 145 |

Distributed Protocols Against Mobile Eavesdroppers | 160 |

Universal Constructions for Large Objects | 168 |

Efficient Detection of Restricted Classes of Global Predicates | 303 |

Faster Possibility Detection by Combining Two Approaches | 318 |

List of Authors | 333 |

### Common terms and phrases

actions application arbitrary assume asynchronous systems Atomic Commitment BCl-n-cube block broadcasting bunch Byzantine faults clique problem communication complexity Computer Science concurrent condition configuration consider construction convergence correct crash defined definition denoted detection deterministic Distributed Algorithms Distributed Computing distributed systems execution fault-tolerant faulty nodes finite global Gouda graph Herlihy's holds hypercubes IEEE implements TV-consensus initial input interval label Lemma linear linearizable load balancing MDST n-cube NB-AC node NP-complete operation optimal participant pointer predicate problem Proc Proceedings processor Proof properties protocol queue random real-time real-time computing requires satisfies schedule Section self-stabilizing sequence sequential shortest paths solved SP-VSC stabilization steps subset Symposium Theorem token topology total order Toueg tree Uniform Consensus universal hash function unreliable failure detectors update variable vertex vote wait-free write