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

Distributed Algorithms

5th International Workshop, WDAG 91, Delphi, Greece, October 7-9, 1991. Proceedings
Mitarbeit:Toueg, Sam; Kirousis, Lefteris

• Broschiertes Buch

Produktbeschreibung

This volume contains the proceedings of the fifthInternational Workshop on Distributed Algorithms (WDAG '91)held in Delphi, Greece, in October 1991. The workshopprovided a forum for researchers and others interested indistributed algorithms, communication networks, anddecentralized systems. The aim was to present recentresearch results, explore directions for future research,and identify common fundamental techniques that serve asbuilding blocks in many distributed algorithms.The volume contains 23 papers selected by the ProgramCommittee from about fifty extended abstracts on the basisof perceived originality and quality and on thematicappropriateness and topical balance. The workshop wasorganizedby the Computer Technology Institute of PatrasUniversity, Greece.

Produktdetails

• Lecture Notes in Computer Science 579
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-55236-9
• 1992.
• Seitenzahl: 336
• Erscheinungstermin: 11. März 1992
• Englisch
• Abmessung: 235mm x 155mm x 19mm
• Gewicht: 554g
• 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.