Distributed Algorithms

1. Front Matter

   PDF

2. Random leaders and random spanning trees

   • Judit Bar-Ilan, Dror Zernik

   Pages 1-12

3. Fault-tolerant critical section management in asynchronous networks

   • Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg

   Pages 13-23

4. Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection

   • Reuven Bar-Yehuda, Oded Goldreich, Alon Itai

   Pages 24-32

5. Applying a path-compression technique to obtain an efficient distributed mutual exclusion algorithm

   • José M. Bernabéu-Aubán, Mustaque Ahamad

   Pages 33-44

6. Combinatorics and geometry of consistent cuts : Application to concurrency theory

   • Bernadette Charron-Bost

   Pages 45-56

7. Distributed fairness algorithms for local area networks with concurrent transmissions

   • Israel Cidon, Yoram Ofek

   Pages 57-69

8. An efficient reliable ring protocol

   • Reuven Cohen, Adrian Segall

   Pages 70-82

9. An efficient solution to the drinking philosophers problem and its extensions

   • David Ginat, A. Udaya Shankar, A. K. Agrawala

   Pages 83-93

10. Highly concurrent logically synchronous multicast

    • Kenneth J. Goldman

    Pages 94-109

11. Reliable broadcast in synchronous and asynchronous environments (preliminary version)

    • Ajei Gopal, Sam Toueg

    Pages 110-123

12. Observing global states of asynchronous distributed applications

    • Jean-Michel Helary

    Pages 124-135

13. Building a global time on parallel machines

    • Jean-Marc Jezequel

    Pages 136-147

14. Functional dependencies of variables in wait-free programs

    • Evangelos Kranakis

    Pages 148-159

15. Two strategies for solving the vertex cover problem on a transputer network

    • R. Lüling, B. Monien

    Pages 160-170

16. Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction

    • Toshimitsu Masuzawa, Naoki Nishikawa, Ken'ichi Hagihara, Nobuki Tokura

    Pages 171-182

17. Simple and efficient election algorithms for anonymous networks

    • Yossi Matias, Yehuda Afek

    Pages 183-194

18. A distributed solution for detecting deadlock in distributed nested transaction systems

    • Marta Rukoz

    Pages 195-206

19. Distributed deadlock detection and resolution with probes

    • Beverly A. Sanders, Philipp A. Heuberger

    Pages 207-218

20. A new algorithm to implement causal ordering

    • André Schiper, Jorge Eggli, Alain Sandoz

    Pages 219-232

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 a forum for researchers and others interested in distributed algorithms on communication networks, graphs, and decentralized systems. The aim was to present recent research results, explore directions for future research, and identify common fundamental techniques that serve as building blocks in many distributed algorithms. Papers describe original results in all areas of distributed algorithms and their applications, including: distributed combinatorial algorithms, distributed graph algorithms, distributed algorithms for control and communication, distributed database techniques, distributed algorithms for decentralized systems, fail-safe and fault-tolerant distributed algorithms, distributed optimization algorithms, routing algorithms, design of network protocols, algorithms for transaction management, composition of distributed algorithms, and analysis of distributed algorithms.

• Dezentralisierte Ablaufsteuerung
• Netze
• Netzprotokolle
• Resolution
• Routing
• Variable
• Verteilte Algorithmen
• Verteilte Systeme
• algorithm
• algorithms
• concurrency
• optimization
• algorithm analysis and problem complexity

Policies and ethics