This book constitutes the refereed proceedings of the 11th International Workshop on Distributed Algorithms, WDAG '97, held in Saarbrücken, Germany, in September 1997.
The volume presents 20 revised full papers selected from 59 submissions. Also included are three invited papers by leading researchers. The papers address a variety of current issues in the area of distributed algorithms and, more generally, distributed systems such as various particular algorithms, randomized computing, routing, networking, load balancing, scheduling, message-passing, shared-memory systems, communication, graph algorithms, etc.
Author(s): Fred B. Schneider (auth.), Marios Mavronicolas, Philippas Tsigas (eds.)
Series: Lecture Notes in Computer Science 1320
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1997
Language: English
Pages: 341
Tags: Algorithm Analysis and Problem Complexity; Computer Communication Networks; Programming Techniques; Computation by Abstract Devices; Operating Systems
Towards fault-tolerant and secure agentry....Pages 1-14
Workflow management — An exercise in distributed computing....Pages 15-19
In memory of Anya Pogosyants....Pages 20-21
Verification of the randomized consensus algorithm of Aspnes and Herlihy: A case study....Pages 22-36
A simple DFS-Based algorithm for linear interval routing....Pages 37-51
ATM layouts with bounded hop count and congestion....Pages 52-65
Scheduling in synchronous networks and the greedy algorithm....Pages 66-80
Rapid convergence of a local load balancing algorithm for asynchronous rings....Pages 81-95
Performing tasks on restartable message-passing processors....Pages 96-110
Revisiting the Paxos algorithm....Pages 111-125
Heartbeat: A timeout-free failure detector for quiescent reliable communication....Pages 126-140
Genuine atomic multicast....Pages 141-154
Low-overhead time-triggered group membership....Pages 155-169
Virtual precedence in asynchronous systems: Concept and applications....Pages 170-184
Detecting global predicates in distributed systems with clocks....Pages 185-199
Fault tolerance bounds for memory consistency....Pages 200-214
Precedence-based memory models....Pages 215-229
Strong interaction fairness in a fully distributed system with unbounded speed variability....Pages 230-244
Reliable communication over partially authenticated networks....Pages 245-259
Self-stabilizing depth-first token passing on rooted networks....Pages 260-274
Secure distributed storage and retrieval....Pages 275-289
Optimal wait-free clock synchronization protocol on a shared-memory multi-processor system....Pages 290-304
Transparent support for wait-free transactions....Pages 305-319
On the power of multi-objects....Pages 320-332
