Distributed Computing 14th International Conference, DISC 2000 Toledo, Spain, October 4-6, 2000 Proceedings

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.

Lower Bounds in Distributed Computing.- Adaptive Mutual Exclusion with Local Spinning.- Bounds for Mutual Exclusion with only Processor Consistency.- Even Better DCAS-Based Concurrent Deques.- Distributed Algorithms for English Auctions.- A Probabilistically Correct Leader Election Protocol for Large Groups.- Approximation Algorithms for Survivable Optical Networks.- Distributed Cooperation During the Absence of Communication.- On the Importance of Having an Identity or, is Consensus really Universal?.- Polynomial and Adaptive Long-lived (2k- 1)-Renaming.- Computing with Infinitely Many Processes.- Establishing Business Rules for Inter-Enterprise Electronic Commerce.- Metering Schemes with Pricing.- Exploitation of Ljapunov Theory for Verifying Self-Stabilizing Algorithms.- Self-Stabilizing Local Mutual Exclusion and Daemon Refinement.- More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs.- Gossip versus Deterministically Constrained Flooding on Small Networks.- Thrifty Generic Broadcast.- Locating Information with Uncertainty in Fully Interconnected Networks.- Optimistic Replication for Internet Data Services.- Scalable Replication in Database Clusters.- Disk Paxos.- Objects Shared by Byzantine Processes.- Short Headers Suffice for Communication in a DAG with Link Failures.- Consistency Conditions for a CORBA Caching Service.