Distributed algorithms : 7th International Workshop, WDAG'93, Lausanne, Switzerland, September 27 29, 1993 : proceedings
This volume presents the proceedings of the Seventh International Workshop on Distributed Algorithms (WDAG 93), held in Lausanne, Switzerland, September 1993. It contains 22 papers selected from 72 submissions. The selection was based on originality, quality, and relevance to the field of distribute...
Salvato in:
| Ente Autore: | |
|---|---|
| Altri autori: | |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
725 |
| Soggetti: | |
| Accesso 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 |
| Nota: |
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, Texte imprimé, 9783540572718 • Distributed Algorithms, Texte imprimé, 9783662202210 • Distributed algorithms, 7th International Workshop, WDAG '93, Lausanne, Switzerland, September 27-29, 1993, proceedings, André Schiper (ed.), Berlin, Springer-Verlag, 1993, 1 vol. (viii-323 p.), Lecture notes in computer science, 0-387-57271-6 |
Sommario:
- Efficient wait-free implementation of a concurrent priority queue
- Binary snapshots
- Linear-time snapshot protocols for unbalanced systems
- Towards a necessary and sufficient condition for wait-free synchronization (Extended Abstract)
- Efficient algorithms for checking the atomicity of a run of read and write operations
- Benign failure models for shared memory
- Generalized agreement between concurrent fail-stop processes
- Controlling memory access concurrency in efficient fault-tolerant parallel algorithms (extended abstract)
- Asynchronous epoch management in replicated databases
- Crash resilient communication in dynamic networks
- Distributed job scheduling using snapshots
- Optimal time self stabilization in dynamic systems
- Tolerating transient and permanent failures (extended abstract)
- Quick atomic broadcast
- Time bounds for decision problems in the presence of timing uncertainty and failures
- Boolean Routing
- Notes on sorting and counting networks (extended abstract)
- A simple, efficient algorithm for maximum finding on rings
- Wang tilings and distributed orientation on anonymous torus networks (extended abstract)
- Fairness of N-party synchronization and its implementation in a distributed environment
- Programming distributed reactive systems: A strong and weak synchronous coupling
- Using message semantics to reduce rollback in the time warp mechanism.