Distributed Computing: 16th International Conference, DISC 2002. Toulouse, France, October 28-30, 2002, Proceedings, Zväzok 16Dahlia Malkhi Springer Science & Business Media, 14. 10. 2002 - 369 strán (strany) 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. |
Obsah
EarlyDelivery Dynamic Atomic Broadcast | 1 |
Secure Computation without Agreement | 17 |
Efficient Maintenance of Views at Data Warehouses | 33 |
ConditionBased Protocols for Set Agreement Problems | 48 |
Distributed Agreement and Its Relation with ErrorCorrecting Codes | 63 |
On the Stability of Compositions of Universally Stable Greedy ContentionResolution Protocols | 88 |
Transformations of SelfStabilizing Algorithms | 103 |
Simple WaitFree Multireader Registers | 118 |
AssignmentBased Partitioning in a Condition Monitoring System | 206 |
Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes | 222 |
Failure Detection Lower Bounds on Registers and Consensus | 237 |
Improved Compact Routing Scheme for Chordal Graphs | 252 |
A Practical Multiword CompareandSwap Operation | 265 |
Necessary and Sufficient Information about Failures to Solve Predicate Detection | 280 |
Bounding Work and Communication in Robust Cooperative Computation | 295 |
Minimal Byzantine Storage | 311 |
An Efficient Universal Construction for MessagePassing Systems | 133 |
Ruminations on DomainBased Reliable Broadcast | 148 |
Stateless Termination Detection | 163 |
A Reconfigurable Atomic Memory Service for Dynamic Networks | 173 |
Ad Hoc Membership for Scalable Applications | 191 |
WaitFree nSet Consensus When Inputs Are Restricted | 326 |
A Mechanism for Supporting DynamicSized LockFree Data Structures | 339 |
On the Impact of Fast Failure Detectors on RealTime FaultTolerant Systems | 354 |
370 | |
Iné vydania - Zobraziť všetky
Časté výrazy a frázy
abort abstraction adversary assigned assume asynchronous atomic broadcast Byzantine agreement Byzantine failures CASN chordal graphs client codeword communication compare-and-swap complete concurrent condition configuration consensus algorithm consider consistency construction correct process data warehouse decide define definition denote descriptor Distributed Computing distributed system event execution failure detector fault-tolerant faults FIFO garbage-collection graph guarantees implementation initial input values input vector k-set agreement latency Lemma linearizable LNCS lower bound Malkhi message passing multicast node objects output packets paper performed phase predicate detection Proc process pi processor Proof properties query queue quorum RDCSS received Reliable Broadcast requires round safe semantics SBQ-L Section secure computation semantics sender sequence servers shared memory shared variable solve consensus sticky bits strong consensus subset synchronous systems termination Theorem timestamp token total order tree update wait-free write operation