Distributed algorithms : 5th international workshop, WDAG '91, Delphi, Greece, October 7-9, 1991 : proceedings
This volume contains the proceedings of the fifth International Workshop on Distributed Algorithms (WDAG '91) held in Delphi, Greece, in October 1991. The workshop provided a forum for researchers and others interested in distributed algorithms, communication networks, and decentralized systems...
Đã lưu trong:
| Tác giả của công ty: | |
|---|---|
| Tác giả khác: | , , |
| Định dạng: | Livre numérique |
| Ngôn ngữ: | Anglais |
| Được phát hành: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Loạt: | Lecture notes in computer science
579 |
| Những chủ đề: | |
| Truy cập trực tuyến: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Chú thích: |
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, 5th international workshop, WDAG '91, Delphi, Greece, October 7-9, 1991, proceedings, S. Toueg, P.G. Spirakis, L. Kirousis, eds, Berlin, Springer-Verlag, 1992, 1 vol. (X-318 p.), Lecture notes in computer science, 3-540-55236-7 • Distributed Algorithms, Texte imprimé, 9783662170618 |
Mục lục:
- On the limitation of the global time assumption in distributed systems
- Causal memory
- More on the power of random walks: Uniform self-stabilizing randomized algorithms
- Pseudo read-modify-write operations: Bounded wait-free implementations
- Maintaining digital clocks in step
- Implementing FIFO queues and stacks
- Optimal amortized distributed consensus
- Optimally simulating crash failures in a byzantine environment
- Efficient distributed consensus with n=(3 + ?)t processors
- Randomized consensus in expected O(n2log n) operations
- Using adaptive timeouts to achieve at-most-once message delivery
- Uniform dynamic self-stabilizing leader election
- The quickest path problem in distributed computing systems
- The communication complexity of the two list problem
- Distributed algorithms for updating shortest paths
- Minimal shared information for concurrent reading and writing
- Reading many variables in one atomic operation solutions with linear or sublinear complexity
- Analysis of distributed algorithms based on recurrence relations
- Detection of global state predicates
- Using consistent subcuts for detecting stable properties
- Atomic m-register operations
- A robust distributed mutual exclusion algorithm
- Message delaying synchronizers.