Distributed Computing (eBook, PDF)

16th International Conference, DISC 2002. Toulouse, France, October 28-30, 2002, Proceedings
Redaktion: Malkhi, Dahlia

• Format: PDF

Produktbeschreibung

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.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Berlin Heidelberg
• Seitenzahl: 378
• Erscheinungstermin: 30. Juni 2003
• Englisch
• ISBN-13: 9783540361084
• Artikelnr.: 52980735

Autorenporträt

Dahlia Malkhi, University of Jerusalem, Jerusalem, Israel

Inhaltsangabe

Early-Delivery Dynamic Atomic Broadcast.- Secure Computation without Agreement.- The Lord of the Rings: Efficient Maintenance of Views at Data Warehouses.- Condition-Based Protocols for Set Agreement Problems.- Distributed Agreement and Its Relation with Error-Correcting Codes.- On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols.- Transformations of Self-Stabilizing Algorithms.- Simple Wait-Free Multireader Registers.- An Efficient Universal Construction for Message-Passing Systems.- Ruminations on Domain-Based Reliable Broadcast.- Stateless Termination Detection.- RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks.- Ad Hoc Membership for Scalable Applications.- Assignment-Based Partitioning in a Condition Monitoring System.- Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes.- Failure Detection Lower Bounds on Registers and Consensus.- Improved Compact Routing Scheme for Chordal Graphs.- A Practical Multi-word Compare-and-Swap Operation.- Failure Detection Sequencers: Necessary and Sufficient Information about Failures to Solve Predicate Detection.- Bounding Work and Communication in Robust Cooperative Computation.- Minimal Byzantine Storage.- Wait-Free n-Set Consensus When Inputs Are Restricted.- The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures.- On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems.