Distributed Computing 13th International Symposium, DISC'99, Bratislava, Slovak Republic, September 27-29, 1999, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Jayanti, Prasad (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1999.
• Έκδοση: 1st ed. 1999.
• Σειρά: Lecture Notes in Computer Science, 1693
• Θέματα: Computer communication systems.; Architecture, Computer.; Computer programming.; Algorithms.; Computers.; Operating systems (Computers).; Computer Communication Networks.; Computer System Implementation.; Programming Techniques.; Algorithm Analysis and Problem Complexity.; 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. This volume includes 23 contributed papers and an invited lecture, all presented at DISC '99, held on September 27-29, 1999 in Bratislava, Slovak Rep...

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

• Invited Lecture
• A Case for Message Oriented Middleware
• Regular Papers
• Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast
• Efficient Algorithms to Implement Unreliable Failure Detectors in Partially Synchronous Systems
• Solving Consensus Using Chandra-Toueg's Unreliable Failure Detectors: A General Quorum-Based Approach
• A Dynamic Primary Configuration Group Communication Service
• Asynchronous Group Membership with Oracles
• Generic Broadcast
• Non-blocking Asynchronous Byzantine Quorum Systems
• Byzantine Agreement Secure against General Adversaries in the Dual Failure Model
• Randomness Recycling in Constant-Round Private Computations
• Abuse-Free Multi-party Contract Signing
• Fair and Efficient Mutual Exclusion Algorithms
• Fast and Scalable Mutual Exclusion
• The Congenial Talking Philosophers Problem in Computer Networks
• Software Fault Tolerance of Concurrent Programs Using Controlled Re-execution
• DUALITY: An Architecture Independent Design Model for Parallel Systems Based on Partial Order Semantics
• A New Rewrite Method for Proving Convergence of Self-Stabilizing Systems
• Stabilization-Preserving Atomicity Refinement
• Self-Testing/Correcting Protocols
• Randomization Helps to Perform Tasks on Processors Prone to Failures
• A New Scheduling Algorithm for General Strict Multithreaded Computations
• Consensus Numbers of Transactional Objects
• Linearizability in the Presence of Drifting Clocks and Under Different Delay Assumptions
• Maintenance of a Spanning Tree in Dynamic Networks.