DISC, the International Symposium on DIStributed Computing, is an annual forum for research presentations on all facets of distributed computing. This volume includes 23 contributed papers and an invited lecture, all presented at DISC ’99, held on September 27-29, 1999 in Bratislava, Slovak Republic. In addition to regular submissions, the call for papers for DISC ’99 also - licited Brief Announcements (BAs). We received 60 regular submissions and 15 brief announcement submissions. These were read and evaluated by the p- gramcommittee, with the additional help of external reviewerswhen needed. At the program committee meeting on June 10-11 at Dartmouth College, Hanover, USA, 23 regular submissions and 4 BAs were selected for presentation at DISC ’99. The extended abstracts of these 23 regular papers appear in this volume, while the four BAs appear as a special publication of Comenius Univ- sity, Bratislava– the hostof DISC ’99.It is expected that the regularpapers will be submitted later, in more polished form, to fully refereed scienti?c journals. Of the 23 regular papers selected for the conference, 12 quali?ed for the Best Student Paper award. The program committee awarded this honor to the paper entitled “Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast” by Marcos Aguilera, Sam Toueg, and Borislav Deianov. Marcos and Borislav, who are both students, share this award.
Author(s): Guruduth Banavar, Tushar Chandra, Robert Strom, Daniel Sturman (auth.), Prasad Jayanti (eds.)
Series: Lecture Notes in Computer Science 1693
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1999
Language: English
Pages: 366
Tags: Computer Communication Networks; Algorithm Analysis and Problem Complexity; Programming Techniques; Computation by Abstract Devices; Operating Systems
A Case for Message Oriented Middleware....Pages 1-17
Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast....Pages 19-34
Efficient Algorithms to Implement Unreliable Failure Detectors in Partially Synchronous Systems....Pages 34-49
Solving Consensus Using Chandra-Toueg’s Unreliable Failure Detectors: A General Quorum-Based Approach....Pages 49-63
A Dynamic Primary Configuration Group Communication Service....Pages 64-78
Asynchronous Group Membership with Oracles....Pages 79-94
Generic Broadcast....Pages 94-106
Non-blocking Asynchronous Byzantine Quorum Systems....Pages 109-122
Byzantine Agreement Secure against General Adversaries in the Dual Failure Model....Pages 123-139
Randomness Recycling in Constant-Round Private Computations....Pages 140-149
Abuse-Free Multi-party Contract Signing....Pages 151-166
Fair and Efficient Mutual Exclusion Algorithms....Pages 166-179
Fast and Scalable Mutual Exclusion....Pages 180-195
The Congenial Talking Philosophers Problem in Computer Networks....Pages 195-211
Software Fault Tolerance of Concurrent Programs Using Controlled Re-execution....Pages 212-225
DUALITY: An Architecture Independent Design Model for Parallel Systems Based on Partial Order Semantics....Pages 226-239
A New Rewrite Method for Proving Convergence of Self-Stabilizing Systems....Pages 240-255
Stabilization-Preserving Atomicity Refinement....Pages 256-268
Self-Testing/Correcting Protocols....Pages 269-284
Randomization Helps to Perform Tasks on Processors Prone to Failures....Pages 284-296
A New Scheduling Algorithm for General Strict Multithreaded Computations....Pages 297-311
Consensus Numbers of Transactional Objects....Pages 312-326
Linearizability in the Presence of Drifting Clocks and Under Different Delay Assumptions....Pages 327-341
Maintenance of a Spanning Tree in Dynamic Networks....Pages 342-355
