Distributed algorithms : 8th International Workshop, WDAG '1994, Terschelling, The Netherlands, September 29 October 1, 1994 : proceedings
This volume presents the proceedings of the 8th International Workshop on Distributed Algorithms (WDAG '94), held on the island of Terschelling, The Netherlands in September 1994. Besides the 23 research papers carefully selected by the program committee, the book contains 3 invited papers. The...
Kaydedildi:
| Müşterek Yazar: | |
|---|---|
| Diğer Yazarlar: | , |
| Materyal Türü: | Livre numérique |
| Dil: | Anglais |
| Baskı/Yayın Bilgisi: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Seri Bilgileri: | Lecture notes in computer science
857 |
| Konular: | |
| Online Erişim: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Not: |
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, 8th international workshop, WDAG '94, Terschelling, the Netherlands, September 29-October 1, 1994, proceedings, 1994, Berlin, Springer-Verlag, 1 vol. (x-369 p.), Lecture notes in computer science, 3-540-58449-8 • Distributed Algorithms, Texte imprimé, 9783662182543 |
İçindekiler:
- Replicated file management in large-scale distributed systems
- Realization of PRAMs: Processor design
- Factoring
- Primary partition Virtually-synchronous communication harder than consensus
- Secure distributed computing: Theory and practice
- Fast increment registers
- Coping with contention
- Exotic behaviour of consensus numbers
- Space-optimum conflict-free construction of 1-writer 1-reader multivalued atomic variable
- Linear-time snapshot using multi-writer multi-reader registers
- Fast, long-lived renaming
- Anomalies in the wait-free hierarchy
- Finding the extrema of a distributed multiset
- The level of handshake required for establishing a connection
- Local labeling and resource allocation using preprocessing
- A scalable approach to routing in ATM networks
- Low complexity network synchronization
- An incremental distributed algorithm for computing biconnected components
- Reaching (and maintaining) agreement in the presence of mobile faults
- Uniform deterministic self-stabilizing ring-orientation on odd-length rings
- Using failure detectors to solve consensus in asynchronous shared-memory systems
- An algorithm with optimal failure locality for the dining philosophers problem
- Average and randomized complexity of distributed problems
- Self-stabilization by local checking and global reset
- Breakpoints and time in distributed computations
- Cheaper matrix clocks.