Skip to content

Distributed Algorithms 11th International Workshop, WDAG '97, Saarbrucken, Germany, September 24-26, 1997: Proceedings

Best in textbook rentals since 2012!

ISBN-10: 3540635750

ISBN-13: 9783540635758

Edition: 1997

Authors: Mario Mavronicolas, Philippas Tsigas

List price: $54.99
Shipping box This item qualifies for FREE shipping.
Blue ribbon 30 day, 100% satisfaction guarantee!
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!

Description:

This book constitutes the refereed proceedings of the 11th International Workshop on Distributed Algorithms, WDAG '97, held in Saarbrücken, Germany, in September 1997.The volume presents 20 revised full papers selected from 59 submissions. Also included are three invited papers by leading researchers. The papers address a variety of current issues in the area of distributed algorithms and, more generally, distributed systems such as various particular algorithms, randomized computing, routing, networking, load balancing, scheduling, message-passing, shared-memory systems, communication, graph algorithms, etc.
Customers also bought

Book details

List price: $54.99
Copyright year: 1997
Publisher: Springer Berlin / Heidelberg
Publication date: 9/10/1997
Binding: Paperback
Pages: 341
Size: 6.10" wide x 9.25" long x 1.00" tall
Weight: 2.398
Language: English

Towards Fault-Tolerant and Secure Agentry
Workflow Management: An Exercise in Distributed Computing
In Memory of Anya Pogosyants (Biographical Note)
Verification of the Randomized Consensus Algorithm of Aspnes and Herlihy: A Case Study
A Simple DFS-Based Algorithm for Linear Interval Routing
ATM Layouts with Bounded Hop Count and Congestion
Scheduling in Synchronous Networks and the Greedy Algorithm
Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings
Performing Tasks on Restartable Message-Passing Processors
Revisiting the Paxos Algorithm
Heartbeat: A Timeout-Free Failure Detector for Quiescent Reliable Communication
Genuine Atomic Multicast
Low-Overhead Time-Triggered Group Membership
Virtual Precedence in Asynchronous Systems: Concept and Applications
Detecting Global Predicates in Distributed Systems with Clocks
Fault Tolerance Bounds for Memory Consistency
Precedence-Based Memory Models
Strong Interaction Fairness in a Fully Distributed System with Unbounded Speed Variability
Reliable Communication over Partially Authenticated Networks
Self-Stabilizing Depth-First Token Passing on Rooted Networks
Secure Distributed Storage and Retrieval
Optimal Wait-Free Clock Synchronization Protocol on a Shared-Memory Multi-processor System
Transparent Support for Wait-Free Transactions
On the Power of Multi-objects
Author Index