Distributed computing : 12th international symposium, DISC 98 Andros, Greece, September 24 26, 1998 : proceedings
This book constitutes the refereed proceedings of the 12th International Symposium on Distributed Computing, DISC'98, held in Andros, Greece, in September 1998. The 28 revised papers presented were carefully reviewed and selected from a total of 87 submissions. Also included are one invited pap...
Zapisane w:
| Korporacja: | |
|---|---|
| Kolejni autorzy: | |
| Format: | Livre numérique |
| Język: | Anglais |
| Wydane: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seria: | Lecture notes in computer science
1499 |
| Hasła przedmiotowe: | |
| Dostęp online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Komentarz: |
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, 12th international symposium, DISC '98, Andros, Greece, September 1998, proceedings, Shay Kutten (ed.), 1998, Berlin, Springer, 1 vol. (XI-418 p.), Lecture notes in computer science, 3-540-65066-0 • Distributed Computing, Texte imprimé, 9783662191033 |
Spis treści:
- Sense of direction in distributed computing
- Top-down considerations on distributed computing
- Inter-task co-ordination in long-lived distributed applications
- Seamlessly selecting the best copy from internet-wide replicated web servers
- Wait-free synchronization in quantum-based multiprogrammed systems
- Computing in totally anonymous asynchronous shared memory systems
- Transient fault detectors
- Directed virtual path layouts in ATM networks
- A decision-theoretic approach to reliable message delivery
- Propagation and leader election in a multihop broadcast environment
- The arrow distributed directory protocol
- Efficient Byzantine agreement secure against general adversaries
- Long-lived, fast, waitfree renaming with optimal name space and high throughput
- The compactness of interval routing for almost all graphs
- A wait-free classification of loop agreement tasks
- A stabilizing repair timer
- Java: Memory consistency and process coordination
- A complete and constant time wait-free implementation of CAS from LL/SC and vice versa
- Failure detection and consensus in the crash-recovery model
- A more committed quorum-based three phase commit protocol
- Multicast group communication as a base for a load-balancing replicated data service
- Efficient deadlock-free multi-dimensional interval routing in interconnection networks
- A new protocol for efficient cooperative transversal Web caching
- Fairness of shared objects
- Optimistic Atomic Broadcast
- Approximate agreement with mixed mode faults: Algorithm and lower bound
- Using remote access histories for thread scheduling in distributed shared memory systems
- The Bancomat problem: An example of resource allocation in a partitionable asynchronous system
- Lifetime based consistency protocols for distributedobjects
- Deriving a scalable algorithm for mutual exclusion
- OFC: A distributed fossil-collection algorithm for Time-Warp.