Maurice Herlihy

Distributed Computing: 14th International Conference, Disc 2000 Toledo, Spain, October 4-6, 2000 Proceedings - Lecture Notes in Computer Science Maurice Herlihy

Marc Notes: Includes bibliographical references and index. Table of Contents: 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. Publisher Marketing: This text constitutes the refereed proceedings of the 14th International Conference on Distributed Computing, DISC 2000, held in Toledo, Spain in October 2000. The 23 revised full papers, presented together with one invited contribution, were carefully reviewed and selected from more than 100 submissions. The papers address a variety of issues in distributed computing including mutual exclusion, distributed algorithms, protocols, approximation algorithms, distributed co-operation, electronic commerce, self-stabilizing algorithms, lower bounds, networking, broadcasting, Internet services, interconnection networks, distributed objects, CORBA, and other topics.