Skip to content

Distributed Algorithms 10th International Workshop, WDAG '96, Bologna, Italy, October 9 - 11, 1996. Proceedings

Spend $50 to get a free movie!

ISBN-10: 3540617698

ISBN-13: 9783540617693

Edition: 1996

Authors: �zalp Babaoglu, Keith Marzullo, G. Goos, J. Hartmanis, Jan Van Leeuwen

List price: $54.99
Blue ribbon 30 day, 100% satisfaction guarantee!
Out of stock
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!


This book constitutes the refereed proceedings of the 10th International Workshop on Distributed Algorithms, WDAG '96, held in Bologna, Italy, in October 1996.The volume presents 21 revised full papers selected from 75 submissions together with invited contributions by Butler Lampson and Domenico Ferrari. The volume reflects the transition of the area from formerly being the domain of a small research community to becoming the dominant computing paradigm and an industrial technology. Among the topics covered are all current aspects of distributed algorithms ranging from theory to applications such as distributed intelligent agents.
Customers also bought

Book details

List price: $54.99
Copyright year: 1996
Publisher: Springer Berlin / Heidelberg
Publication date: 9/25/1996
Binding: Paperback
Pages: 388
Size: 6.10" wide x 9.25" long x 1.00" tall
Weight: 1.320
Language: English

How to Build a Highly Available System Using Consensus
Distributed Admission Control Algorithms for Real-Time Communication
Randomization and Failure Detection: A Hybrid Approach to Solve Consensus
Levels of Authentication in Distributed Agreement
Efficient and Robust Sharing of Memory in Message-Passing Systems
Plausible Clocks: Constant Size Logical Clocks for Distributed Systems
Abstracting Communication to Reason about Distributed Algorithms
Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes
A Cyclic Distributed Garbage Collector for Network Objects
Incremental, Distributed Orphan Detection and Actor Garbage Collection Using Graph Partitioning and Euler Cycles
A Framework for the Analysis of Non-Deterministic Clock Synchronization Algorithms
Optimal Time Broadcasting in Faulty Star Networks
A Lower Bound for Linear Interval Routing
Topological Routing Schemes
Maintaining a Dynamic Set of Processors in a Distributed System
Collective Consistency
Planar Quorums
"Gamma-Accurate" Failure Detectors
Fast Long-Lived Remaining Improved and Simplified
A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing Environments
The Combinatorial Structure of Wait-Free Solvable Tasks
On the Robustness of [actual symbol not reproducible]
Understanding the Set Consensus Partial Order Using the Borowsky-Gafni Simulation
Author Index