Sam Toueg / Paul G. Spirakis / Lefteris Kirousis (eds.)

Distributed Algorithms

5th International Workshop, WDAG 91, Delphi, Greece, October 7-9, 1991. Proceedings
Ed. by Sam Toueg, Paul G. Spirakis and Lefteris Kirousis

Broschiertes Buch

Produktbeschreibung

This volume contains the proceedings of the fifth International Workshop on Distributed Algorithms (WDAG '91) held in Delphi, Greece, in October 1991. The workshop provided a forum for researchers and others interested in distributed algorithms, communication networks, and decentralized systems. The aim was to present recent research results, explore directions for future research, and identify common fundamental techniques that serve as building blocks in many distributed algorithms. The volume contains 23 papers selected by the Program Committee from about fifty extended abstracts on the basis of perceived originality and quality and on thematic appropriateness and topical balance. The workshop was organizedby the Computer Technology Institute of Patras University, Greece.

Produktdetails

• Lecture Notes in Computer Science Vol.579
• Verlag: Springer, Berlin
• 1992.
• Seitenzahl: 336
• Erscheinungstermin: 11. März 1992
• Englisch
• Abmessung: 235mm x 155mm x 18mm
• Gewicht: 558g
• ISBN-13: 9783540552369
• ISBN-10: 3540552367
• Artikelnr.: 09247142

Inhaltsangabe

On the limitation of the global time assumption in distributed systems.- Causal memory.- More on the power of random walks: Uniform self-stabilizing randomized algorithms.- Pseudo read-modify-write operations: Bounded wait-free implementations.- Maintaining digital clocks in step.- Implementing FIFO queues and stacks.- Optimal amortized distributed consensus.- Optimally simulating crash failures in a byzantine environment.- Efficient distributed consensus with n=(3 + ?)t processors.- Randomized consensus in expected O(n2log n) operations.- Using adaptive timeouts to achieve at-most-once message delivery.- Uniform dynamic self-stabilizing leader election.- The quickest path problem in distributed computing systems.- The communication complexity of the two list problem.- Distributed algorithms for updating shortest paths.- Minimal shared information for concurrent reading and writing.- Reading many variables in one atomic operation solutions with linear or sublinear complexity.- Analysis of distributed algorithms based on recurrence relations.- Detection of global state predicates.- Using consistent subcuts for detecting stable properties.- Atomic m-register operations.- A robust distributed mutual exclusion algorithm.- Message delaying synchronizers.