Distributed Algorithms
5th International Workshop, WDAG 91, Delphi, Greece, October 7-9, 1991. Proceedings
Published on 11. March 1992
Book
Paperback/Softback
X, 326 pages
978-3-540-55236-9 (ISBN)
Description
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.
More details
Series
Edition
1992 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
X, 326 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 19 mm
Weight
511 gr
ISBN-13
978-3-540-55236-9 (9783540552369)
DOI
10.1007/BFb0022433
Schweitzer Classification
Content
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.