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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Fich, Faith Ellen (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
• Έκδοση: 1st ed. 2003.
• Σειρά: Lecture Notes in Computer Science, 2848
• Θέματα: Architecture, Computer.; Computer communication systems.; Computer programming.; Operating systems (Computers).; Computers.; Algorithms.; Computer System Implementation.; Computer Communication Networks.; Programming Techniques.; Operating Systems.; Computation by Abstract Devices.; Algorithm Analysis and Problem Complexity.

Πίνακας περιεχομένων:

• Resilient Consensus for Infinitely Many Processes
• Uniform Solvability with a Finite Number of MWMR Registers
• Timing-Based Mutual Exclusion with Local Spinning
• On the Uncontended Complexity of Consensus
• Probabilistic Quorums for Dynamic Systems
• Efficient Replication of Large Data Objects
• On the Locality of Consistency Conditions
• Multi-writer Consistency Conditions for Shared Memory Objects
• Booting Clock Synchronization in Partially Synchronous Systems
• Automatic Discovery of Mutual Exclusion Algorithms
• On the Implementation Complexity of Specifications of Concurrent Programs
• Competitive Management of Non-preemptive Queues with Multiple Values
• Constructing Disjoint Paths for Secure Communication
• Compact Routing for Flat Networks
• Lower Bounds for Oblivious Single-Packet End-to-End Communication
• Efficient Gossip and Robust Distributed Computation
• Condition-Based Consensus in Synchronous Systems
• Using Conditions to Expedite Consensus in Synchronous Distributed Systems
• Tight Bounds on Early Local Decisions in Uniform Consensus
• Tight Bounds for k-Set Agreement with Limited-Scope Failure Detectors
• On Failure Detectors and Type Boosters
• GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks
• Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks
• Maximizing Remote Work in Flooding-Based Peer-to-Peer Systems
• Overcoming the Majority Barrier in Large-Scale Systems.