product iamge

Distributed Computing: 17th International Conference, DISC 2003, Sorrento, Italy, October 1-3, 2003. Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the 17th International Conference on Distributed Computing, DISC 2003, held in Sorrento, Italy in October 2003.

The 25 revised full papers presented were carefully reviewed and selected from 91 submissions. A broad variety of current issues in distributed computing is addressed, from foundational and theoretical issues to applications in various fields.

Author(s): Michael Merritt, Gadi Taubenfeld (auth.), Faith Ellen Fich (eds.)
Series: Lecture Notes in Computer Science 2848
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2003

Language: English
Pages: 371
Tags: Computer Communication Networks; Programming Techniques; Operating Systems; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity

Front Matter....Pages -
Resilient Consensus for Infinitely Many Processes....Pages 1-15
Uniform Solvability with a Finite Number of MWMR Registers....Pages 16-29
Timing-Based Mutual Exclusion with Local Spinning....Pages 30-44
On the Uncontended Complexity of Consensus....Pages 45-59
Probabilistic Quorums for Dynamic Systems....Pages 60-74
Efficient Replication of Large Data Objects....Pages 75-91
On the Locality of Consistency Conditions....Pages 92-105
Multi-writer Consistency Conditions for Shared Memory Objects....Pages 106-120
Booting Clock Synchronization in Partially Synchronous Systems....Pages 121-135
Automatic Discovery of Mutual Exclusion Algorithms....Pages 136-150
On the Implementation Complexity of Specifications of Concurrent Programs....Pages 151-165
Competitive Management of Non-preemptive Queues with Multiple Values....Pages 166-180
Constructing Disjoint Paths for Secure Communication....Pages 181-195
Compact Routing for Flat Networks....Pages 196-210
Lower Bounds for Oblivious Single-Packet End-to-End Communication....Pages 211-223
Efficient Gossip and Robust Distributed Computation....Pages 224-238
Condition-Based Consensus in Synchronous Systems....Pages 239-248
Using Conditions to Expedite Consensus in Synchronous Distributed Systems....Pages 249-263
Tight Bounds on Early Local Decisions in Uniform Consensus....Pages 264-278
Tight Bounds for k -Set Agreement with Limited-Scope Failure Detectors....Pages 279-291
On Failure Detectors and Type Boosters....Pages 292-305
GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks....Pages 306-320
Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks....Pages 321-336
Maximizing Remote Work in Flooding-Based Peer-to-Peer Systems....Pages 337-351
Overcoming the Majority Barrier in Large-Scale Systems....Pages 352-366
Back Matter....Pages -