Overview

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.

Full Product Details

Author:   Sam Toueg ,  Paul G. Spirakis ,  Lefteris Kirousis
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   1992 ed.
Volume:   579
Dimensions:   Width: 15.50cm , Height: 1.70cm , Length: 23.50cm
Weight:   1.040kg
ISBN:  

9783540552369

ISBN 10:   3540552367
Pages:   326
Publication Date:   11 March 1992
Audience:   College/higher education ,  Professional and scholarly ,  Undergraduate ,  Postgraduate, Research & Scholarly
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print  
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions