## Distributed Algorithms: 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, ProceedingsThis 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. |

### What people are saying - Write a review

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

### Contents

Towards FaultTolerant and Secure Agentry | 1 |

Andreas Reuter International University in Germany GmbH Stuttgart iGr | 15 |

In Memory of Anya Pogosyants by Nancy Lynch | 20 |

A Case Study | 22 |

A Simple DFSBased Algorithm for Linear Interval Routing | 37 |

Congestion | 52 |

Extended Abstract | 66 |

Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings | 81 |

Concept and Applications | 170 |

Detecting Global Predicates in Distributed Systems with Clocks | 185 |

Fault Tolerance Bounds for Memory Consistency | 200 |

PrecedenceBased Memory Models | 215 |

Strong Interaction Fairness in a Fully Distributed System with Unbounded Speed Variability | 230 |

Reliable Communication over Partially Authenticated Networks | 245 |

SelfStabilizing DepthFirst Token Passing on Rooted Networks | 260 |

Secure Distributed Storage and Retrieval | 275 |

Performing Tasks on Restartable MessagePassing Processors | 96 |

Revisiting the Paxos Algorithm | 111 |

A TimeoutFree Failure Detector for Quiescent Reliable Communication | 126 |

Genuine Atomic Multicast | 141 |

LowOverhead TimeTriggered Group Membership | 155 |

Optimal WaitFree Clock Synchronization Protocol on a SharedMemory Multiprocessor System | 290 |

Transparent Support for WaitFree Transactions | 305 |

On the Power of Multiobjects | 320 |

### Common terms and phrases

abstraction actions agent Algorithm Linear-Label assume atomic broadcast authentication automata automaton bound checkpoint clock synchronization coin flipping complexity Computer Science Con(T configuration consider defined definition denote detection Distributed Algorithms Distributed Computing distributed systems Dst(m edge execution fragment failure detector fault fault-tolerant faulty processors finite global graph G greedy algorithm holds implementation initial integer interaction interval labeling layout Lemma linearizability membership set monitoring MWCAS node nonfaulty processors NP-complete number of messages number of tokens paper partial algorithm partial run path PAXOS PAXOS algorithm phase predicate prefix sum probabilistic automaton problem Proceedings process crashes Proof protocol random read operation receive reliable communication restarts satisfies schedule secret sharing Section self-stabilizing sequence sequential consistency servers shared memory step Theorem timestamp total order transaction unreliable failure variables virtual slack wait-free write operation