Distributed algorithms : 3rd international workshop, Nice, France, September 26-28, 1989 : proceedings
This book includes the papers presented at the Third International Workshop on Distributed Algorithms organized at La Colle-sur-Loup, near Nice, France, September 26-28, 1989 which followed the first two successful international workshops in Ottawa (1985) and Amsterdam (1987). This workshop provided...
Gorde:
| Erakunde egilea: | |
|---|---|
| Beste egile batzuk: | , |
| Formatua: | Livre numérique |
| Hizkuntza: | Anglais |
| Argitaratua: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Saila: | Lecture notes in computer science
392 |
| Gaiak: | |
| Sarrera elektronikoa: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Oharra: |
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, 3rd international workshop, Nice, France, September 26-28, 1989, proceedings, J.-C. Bermond, M. Raynal (eds.), Berlin, Springer-Verlag, 1989, 1 vol. (VI-314 p.), Lecture notes in computer science, 3-540-51687-5 • Distributed Algorithms, Texte imprimé, 9783662213797 |
Aurkibidea:
- Random leaders and random spanning trees
- Fault-tolerant critical section management in asynchronous networks
- Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection
- Applying a path-compression technique to obtain an efficient distributed mutual exclusion algorithm
- Combinatorics and geometry of consistent cuts : Application to concurrency theory
- Distributed fairness algorithms for local area networks with concurrent transmissions
- An efficient reliable ring protocol
- An efficient solution to the drinking philosophers problem and its extensions
- Highly concurrent logically synchronous multicast
- Reliable broadcast in synchronous and asynchronous environments (preliminary version)
- Observing global states of asynchronous distributed applications
- Building a global time on parallel machines
- Functional dependencies of variables in wait-free programs
- Two strategies for solving the vertex cover problem on a transputer network
- Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction
- Simple and efficient election algorithms for anonymous networks
- A distributed solution for detecting deadlock in distributed nested transaction systems
- Distributed deadlock detection and resolution with probes
- A new algorithm to implement causal ordering
- Symmetry breaking in asynchronous rings with o(n) messages
- Designing distributed algorithms by means of formal sequentially phased reasoning
- Possibility and impossibility results in a shared memory environment
- Communication heuristics in distributed combinatorial search algorithms
- The role of inhibition in asynchronous consistent-cut protocols
- How to construct an atomic variable (extended abstract)
- Electing a leader when processor identity numbers are not distinct (extended abstract).