Distributed computing : 13th International Symposium, DISC 99 Bratislava, Slovak Republic September 27 29, 1999 : proceedings
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 Republic....
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
1693 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Distributed computing, 13th International Symposium, DISC'99, Bratislava, Slovak Republic, September 1999, proceedings, Prasad Jayanti (ed.), 1999, New York, Springer, 1 vol. (X-355 p.), Lecture notes in computer science, 3-540-66531-5 • Distributed Computing, Texte imprimé, 9783662172414 |
Indholdsfortegnelse:
- 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.