Distributed Computing

The International Symposium on DIStributed Computing (DISC) 2002 was held in Toulouse, France, on October 28 30, 2002. The realization of distributed s- tems on numerous fronts and the proliferation of the Internet continue to make the symposium highly important and relevant. There were 76 regular submissions to DISC this year, which were read and evaluated by program committee members assisted by external reviewers. Twen- four papers were selected by the program committee to be included in these proceedings. The quality of submissions was high, and the committee had to decline some papers worthy of publication. The best student paper award was selected from among regular submissions that were not co-authored by any program committee member, and was given to Yongqiang Huang for his contribution Assignment-Based Partitioning in a Condition Monitoring System , co-authored with Hector Garcia-Molina. October 2002 Dahlia Malkhi Organizing Committee Mamoun Filali Philippe Mauran G`erard Padiou (Chair) Philippe Qu`einnec Anne-Marie Zerr (Secretary) Steering Committee Andr`e Schiper, Chair (EPFL, Switzerland) Michel Raynal, Vice-chair (Irisa, France) Maurice Herlihy (Brown University, USA) Dahlia Malkhi, Program Chair (Hebrew University of Jerusalem, Israel) Jennifer Welch (Texas A&M University, USA) Alex Shvartsman (University of Connecticut, USA) Shay Kutten (Technion, Israel) Program Committee Gustavo Alonso (ETH Zurich, Switzerland) Roberto Baldoni (University of Rome, Italy) Dave Bakken (Washington State University, USA) Paul Ezhilchelvan (University of Newcastle, UK) Christof Fetzer (AT&T Labs-Research, USA) Faith Fich (University of Toronto, Canada) Roy Friedman (Technion, Israel) Juan A.

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.