Distributed algorithms : 6th international workshop, WDAG '92, Haifa, Israel, November 2-4, 1992 : proceedings
This volume presents the proceedings of the Sixth Workshop on Distributed Algorithms (WDAG 92), held in Haifa, Israel, November 2-4, 1992. WDAG provides a forum for researchers and other parties interested in distributedalgorithms and their applications. The aim is to present recent research results...
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
647 |
| 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, 6th international workshop, WDAG '92, Haifa, Israel, November 2-4, 1992, proceedings, A. Segall, S. Zaks, eds, Berlin, Springer-Verlag, 1992, 1 vol. (X-378 p.), Lecture notes in computer science, 3-540-56188-9 • Distributed Algorithms, Texte imprimé, 9783662187586 |
Indholdsfortegnelse:
- Sparser: A paradigm for running distributed algorithms
- Closed schedulers: Constructions and applications to consensus protocols
- Efficient atomic snapshots using lattice agreement
- Choice coordination with multiple alternatives (preliminary version)
- Some results on the impossibility, universality, and decidability of consensus
- Wait-free test-and-set
- A concurrent time-stamp scheme which is linear in time and space
- Tentative and definite distributed computations: An optimistic approach to network synchronization
- Semisynchrony and real time
- Optimal time Byzantine agreement for t /8 with linear messages
- A continuum of failure models for distributed computing
- Simulating crash failures with many faulty processors (extended abstract)
- An efficient topology update protocol for dynamic networks
- Memory adaptive self-stabilizing protocols (extended abstract)
- Optimal early stopping in distributed consensus
- Traffic-light scheduling on the grid
- Distributed computing on anonymous hypercubes with faulty components
- Message terminate algorithms for anonymous rings of unknown size
- Distributed resource allocation algorithms
- Membership algorithms for multicast communication groups
- The granularity of waiting (extended Abstract)
- The cost of order in asynchronous systems
- Efficient, strongly consistent implementations of shared memory
- Optimal primary-backup protocols.