SALE ON NOW! PROMOTIONS

Close Notification

Your cart does not contain any items

Distributed Algorithms

2nd International Workshop, Amsterdam, The Netherlands, July 8-10, 1987. Proceedings

Jan van Leeuwen

$107.95   $86.53

Paperback

Not in-store but you can order this
How long will it take?

QTY:

English
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
01 May 1988
This volume presents the proceedings of the 2nd International Workshop on Distributed Algorithms, held July 8-10, 1987, in Amsterdam, The Netherlands. It contains 29 papers on new developments in the area of the design and analysis of distributed algorithms. The topics covered include, e.g. algorithms for distributed consensus and agreement in networks, connection management and topology update schemes, election and termination detection protocols, and other issues in distributed network control.
Edited by:  
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Country of Publication:   Germany
Edition:   1988 ed.
Volume:   312
Dimensions:   Height: 235mm,  Width: 155mm,  Spine: 22mm
Weight:   1.370kg
ISBN:   9783540193661
ISBN 10:   3540193669
Series:   Lecture Notes in Computer Science
Pages:   432
Publication Date:  
Audience:   College/higher education ,  Professional and scholarly ,  Professional & Vocational ,  A / AS level ,  Further / Higher Education
Format:   Paperback
Publisher's Status:   Active
A distributed spanning tree algorithm.- Directed network protocols.- Fault tolerant queries in computer networks.- General and efficient decentralized consensus protocols.- A framework for agreement.- Byzantine firing squad using a faulty external source.- An improved multiple identification algorithm for synchronous broadcasting networks.- Distributed algorithms for tree pattern matching.- On the packet complexity of distributed selection.- Load balancing in a network of transputers.- Experience with a new distributed termination detection algorithm.- A distributed deadlock avoidance technique.- How to detect a failure and regenerate the token in the Log(n) distributed algorithm for mutual exclusion.- Verification of connection-management protocols.- Generalized scheme for topology-update in dynamic networks.- Local fail-safe network reset procedure.- Synchronizing asynchronous bounded delay networks.- A modular proof of correctness for a network synchronizer.- On the use of synchronizers for asynchronous communication networks.- Atomic multireader register.- An optimistic resiliency control scheme for distributed database systems.- A failsafe scheme for replicated information.- Randomized function evaluation on a ring.- A distributed ring orientation algorithm.- Constructing efficient election algorithms from efficient traversal algorithms.- Optimal resilient ring election algorithms.- Fault-tolerant distributed algorithm for election in complete networks.- Lower bounds for synchronous networks and the advantage of local information.- On the existence of generic broadcast algorithms in networks of Communicating Sequential Processes.- Stepwise removal of virtual channels in distributed algorithms.

See Also