This book constitutes the refereed proceedings of the 16th International Conference on Distributed Computing, DISC 2002, held in Toulouse, France, in October 2002.
The 24 revised full papers presented were carefully reviewed and selected from 76 submissions. Among the issues addressed are broadcasting, secure computation, view maintenance, communication protocols, distributed agreement, self-stabilizing algorithms, message-passing systems, dynamic networks, condition monitoring systems, shared memory computing, Byzantine processes, routing, failure detection, compare-and-swap operations, cooperative computation, and consensus algorithms.
Author(s): Ziv Bar-Joseph, Idit Keidar, Nancy Lynch (auth.), Dahlia Malkhi (eds.)
Series: Lecture Notes in Computer Science 2508
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2002
Language: English
Pages: 378
Tags: Computer Communication Networks; Programming Techniques; Operating Systems; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity
Early-Delivery Dynamic Atomic Broadcast....Pages 1-16
Secure Computation without Agreement....Pages 17-32
The Lord of the Rings: Efficient Maintenance of Views at Data Warehouses....Pages 33-47
Condition-Based Protocols for Set Agreement Problems....Pages 48-62
Distributed Agreement and Its Relation with Error-Correcting Codes....Pages 63-87
On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols....Pages 88-102
Transformations of Self-Stabilizing Algorithms....Pages 103-117
Simple Wait-Free Multireader Registers....Pages 118-132
An Efficient Universal Construction for Message-Passing Systems....Pages 133-147
Ruminations on Domain-Based Reliable Broadcast....Pages 148-162
Stateless Termination Detection....Pages 163-172
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks....Pages 173-190
Ad Hoc Membership for Scalable Applications....Pages 191-205
Assignment-Based Partitioning in a Condition Monitoring System....Pages 206-221
Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes....Pages 222-236
Failure Detection Lower Bounds on Registers and Consensus....Pages 237-251
Improved Compact Routing Scheme for Chordal Graphs....Pages 252-264
A Practical Multi-word Compare-and-Swap Operation....Pages 265-279
Failure Detection Sequencers: Necessary and Sufficient Information about Failures to Solve Predicate Detection....Pages 280-294
Bounding Work and Communication in Robust Cooperative Computation....Pages 295-310
Minimal Byzantine Storage....Pages 311-325
Wait-Free n-Set Consensus When Inputs Are Restricted....Pages 326-338
The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures....Pages 339-353
On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems....Pages 354-369
