DISC, the International Symposium on DIStributed Computing, is an annual forum for research presentations on all facets of distributed computing. DISC 2000 was held on4-6 October, 2000 in Toledo, Spain. This volume includes 23 contributed papers and the extended abstract of an invited lecture from last year’s DISC. It is expected that the regular papers will later be submitted in a more polished form to fully refereed scienti?c journals. The extended abstracts of this year’s invited lectures, by Jean-Claude Bermond and Sam Toueg, will appear in next year’s proceedings. We received over 100 regular submissions, a record for DISC. These s- missions were read and evaluated by the program committee, with the help of external reviewers when needed. Overall, the quality of the submissions was excellent, and we were unable to accept many deserving papers. This year’s Best Student Paper award goes to “Polynomial and Adaptive Long-Lived (2k?1)-Renaming” by Hagit Attiya and Arie Fouren. Arie Fouren is the student author.
Author(s): Faith Fich, Eric Ruppert (auth.), Maurice Herlihy (eds.)
Series: Lecture Notes in Computer Science 1914
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2000
Language: English
Pages: 392
Tags: Computer Communication Networks; Algorithm Analysis and Problem Complexity; Programming Techniques; Computation by Abstract Devices; Operating Systems
Lower Bounds in Distributed Computing....Pages 1-28
Adaptive Mutual Exclusion with Local Spinning....Pages 29-43
Bounds for Mutual Exclusion with only Processor Consistency....Pages 44-58
Even Better DCAS-Based Concurrent Deques....Pages 59-73
Distributed Algorithms for English Auctions....Pages 74-88
A Probabilistically Correct Leader Election Protocol for Large Groups....Pages 89-103
Approximation Algorithms for Survivable Optical Networks....Pages 104-118
Distributed Cooperation During the Absence of Communication....Pages 119-133
On the Importance of Having an Identity or, is Consensus really Universal?....Pages 134-148
Polynomial and Adaptive Long-lived (2 k - 1)-Renaming....Pages 149-163
Computing with Infinitely Many Processes....Pages 164-178
Establishing Business Rules for Inter-Enterprise Electronic Commerce....Pages 179-193
Metering Schemes with Pricing....Pages 194-208
Exploitation of Ljapunov Theory for Verifying Self-Stabilizing Algorithms....Pages 209-222
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement....Pages 223-237
More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs....Pages 238-252
Gossip versus Deterministically Constrained Flooding on Small Networks....Pages 253-267
Thrifty Generic Broadcast....Pages 268-282
Locating Information with Uncertainty in Fully Interconnected Networks....Pages 283-296
Optimistic Replication for Internet Data Services....Pages 297-314
Scalable Replication in Database Clusters....Pages 315-329
Disk Paxos....Pages 330-344
Objects Shared by Byzantine Processes....Pages 345-359
Short Headers Suffice for Communication in a DAG with Link Failures....Pages 360-373
Consistency Conditions for a CORBA Caching Service....Pages 374-388
