Distributed Algorithms: 3rd International Workshop, Nice, France, September 26-28, 1989. Proceedings by Jean-Claude BermondDistributed Algorithms: 3rd International Workshop, Nice, France, September 26-28, 1989. Proceedings by Jean-Claude Bermond

Distributed Algorithms: 3rd International Workshop, Nice, France, September 26-28, 1989. Proceedings

EditorJean-Claude Bermond, Michel Raynal

Paperback | September 6, 1989

Pricing and Purchase Info

$125.55 online 
$141.95 list price save 11%
Earn 628 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.
Title:Distributed Algorithms: 3rd International Workshop, Nice, France, September 26-28, 1989. ProceedingsFormat:PaperbackDimensions:321 pages, 9.17 × 6.1 × 0.03 inPublished:September 6, 1989Publisher:Springer Berlin HeidelbergLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540516875

ISBN - 13:9783540516873

Look for similar items by category:

Reviews

Table of Contents

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