Jean-Claude Bermond / Michel Raynal (eds.)

Distributed Algorithms

3rd International Workshop, Nice, France, September 26-28, 1989. Proceedings
Mitarbeit:Bermond, Jean-Claude; Raynal, Michel

• Broschiertes Buch

Produktbeschreibung

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, distributedoptimization algorithms, routing algorithms, design of network protocols, algorithms for transaction management, composition of distributed algorithms, and analysis of distributed algorithms.

Produktdetails

• Lecture Notes in Computer Science 392
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-51687-3
• 1989.
• Seitenzahl: 328
• Erscheinungstermin: 6. September 1989
• Englisch
• Abmessung: 235mm x 155mm x 18mm
• Gewicht: 594g
• ISBN-13: 9783540516873
• ISBN-10: 3540516875
• Artikelnr.: 09216476

Inhaltsangabe

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).