Distributed Algorithms

1. Symmetry breaking in asynchronous rings with o(n) messages

   • Paul Spirakis, Basil Tampakas, Athanasios Tsiolis

   Pages 233-241

2. Designing distributed algorithms by means of formal sequentially phased reasoning

   • F. A. Stomp, W. P. de Roever

   Pages 242-253

3. Possibility and impossibility results in a shared memory environment

   • Gadi Taubenfeld, Shlomo Moran

   Pages 254-267

4. Communication heuristics in distributed combinatorial search algorithms

   • Alfred Taudes

   Pages 268-279

5. The role of inhibition in asynchronous consistent-cut protocols

   • Kim Taylor

   Pages 280-291

6. How to construct an atomic variable (extended abstract)

   • John Tromp

   Pages 292-302

7. Electing a leader when processor identity numbers are not distinct (extended abstract)

   • M. Yamashita, T. Kameda

   Pages 303-314

8. Back Matter

   PDF

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