Distributed Computing

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

AvMaurice Herlihy

Häftad, Engelska, 2000

Del i serien Lecture Notes in Computer Science

558 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book 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 current issues in distributed computing including mutual exclusion, distributed algorithms, protocols, approximation algorithms, distributed cooperation, electronic commerce, self-stabilizing algorithms, lower bounds, networking, broadcasting, Internet services, interconnection networks, distributed objects, CORBA, etc.

Produktinformation

Utgivningsdatum:2000-09-20
Mått:155 x 233 x 22 mm
Vikt:604 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:392
Upplaga:2000
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540411437

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Nätverk och kommunikation inom Data och IT
Programmeringsböcker inom Data och IT

Innehållsförteckning

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.