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

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

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 l...

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

• 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.