Distributed algorithms : 10th international workshop, WDAG '96, Bologna, Italy, October 9-11, 1996 : proceedings
This book constitutes the refereed proceedings of the 10th International Workshop on Distributed Algorithms, WDAG '96, held in Bologna, Italy, in October 1996. The volume presents 21 revised full papers selected from 75 submissions together with invited contributions by Butler Lampson and Domen...
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
1151 |
| 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 algorithms, 10th international workshop, WDAG '96, Bologna, Italy, October 9-11, 1996, proceedings, Özalp Babaožlu, Keith Marzullo, eds, 1996, Berlin, Springer-Verlag, 1 vol. (VIII-379 p.), Lecture notes in computer science, 3-540-61769-8 • Distributed Algorithms, Texte imprimé, 9783662211595 |
Indholdsfortegnelse:
- How to build a highly available system using consensus
- Distributed admission control algorithms for real-time communication
- Randomization and failure detection: A hybrid approach to solve Consensus
- Levels of authentication in distributed agreement
- Efficient and robust sharing of memory in message-passing systems
- Plausible clocks: Constant size logical clocks for Distributed Systems
- Abstracting communication to reason about distributed algorithms
- Simulating reliable links with unreliable links in the presence of process crashes
- A cyclic distributed garbage collector for network objects
- Incremental, distributed orphan detection and actor garbage collection using graph partitioning and euler cycles
- A framework for the analysis of non-deterministic clock synchronisation algorithms
- Optimal time broadcasting in faulty star networks
- A lower bound for Linear Interval Routing
- Topological routing schemes
- Maintaining a dynamic set of processors in a distributed system
- Collective consistency
- Planar quorums
- ?-accurate failure detectors
- Fast, long-lived renaming improved and simplified
- A timestamp based transformation of self-stabilizing programs for distributed computing environments
- The combinatorial structure of wait-free solvable tasks
- On the robustness of h m r
- Understanding the Set Consensus Partial Order using the Borowsky-Gafni Simulation.