Distributed Algorithms: 5th International Workshop, WDAG 91, Delphi, Greece, October 7-9, 1991. Proceedings
Springer Science & Business Media, Mar 11, 1992 - Computers - 318 pages
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.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
arbitrary failures assume atomic registers buffer causal memory Cloture coin communication component Computer Science concurrent configuration construction correct processor defined definition delay denote dequeue detection distributed algorithms Distributed Computing distributed system edge execution history faulty processors FIFO Figure finite flips garbage collection global graph implementation initial input integer interval Lamport Lemma Leslie Lamport lifetime-rejected linearizable lower bound marked graph mutual exclusion Mv(s neighbors node number of messages number of processors number of rounds original-protocol message poset problem Proc Proceedings Programming proof protocol quickest path quorum groups random read operation reader received recurrence relations requires resiliency result safe satisfies scheduler self-stabilizing sequence sequentially consistent server shared memory shared variables shortest paths synchronizer Technion Theorem timestamp token topological sort total number translation tree ts(o tuple update vector clocks wait-free write operation