Distributed Algorithms
Editat de Jean-Claude Bermond, Michel Raynalen Limba Engleză Paperback – 6 sep 1989
Preț: 323.60 lei
Preț vechi: 404.50 lei
-20%
Puncte Express: 485
Carte tipărită la comandă
Livrare economică 27 iulie-10 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540516873
ISBN-10: 3540516875
Pagini: 328
Ilustrații: VIII, 320 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.5 kg
Ediția:1989
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540516875
Pagini: 328
Ilustrații: VIII, 320 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.5 kg
Ediția:1989
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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).