Distributed Algorithms
Editat de Adrian Segall, Shmuel Zaksen Limba Engleză Paperback – 15 oct 1992
Preț: 327.07 lei
Preț vechi: 408.84 lei
-20%
Puncte Express: 491
Preț estimativ în valută:
57.84€ • 66.32$ • 49.99£
57.84€ • 66.32$ • 49.99£
Carte tipărită la comandă
Livrare economică 28 aprilie-12 mai
Specificații
ISBN-13: 9783540561880
ISBN-10: 3540561889
Pagini: 396
Ilustrații: X, 382 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.6 kg
Ediția:1992
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540561889
Pagini: 396
Ilustrații: X, 382 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.6 kg
Ediția:1992
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Sparser: A paradigm for running distributed algorithms.- Closed schedulers: Constructions and applications to consensus protocols.- Efficient atomic snapshots using lattice agreement.- Choice coordination with multiple alternatives (preliminary version).- Some results on the impossibility, universality, and decidability of consensus.- Wait-free test-and-set.- A concurrent time-stamp scheme which is linear in time and space.- Tentative and definite distributed computations: An optimistic approach to network synchronization.- Semisynchrony and real time.- Optimal time Byzantine agreement for t /8 with linear messages.- A continuum of failure models for distributed computing.- Simulating crash failures with many faulty processors (extended abstract).- An efficient topology update protocol for dynamic networks.- Memory adaptive self-stabilizing protocols (extended abstract).- Optimal early stopping in distributed consensus.- Traffic-light scheduling on the grid.- Distributed computing on anonymous hypercubes with faulty components.- Message terminate algorithms for anonymous rings of unknown size.- Distributed resource allocation algorithms.- Membership algorithms for multicast communication groups.- The granularity of waiting (extended Abstract).- The cost of order in asynchronous systems.- Efficient, strongly consistent implementations of shared memory.- Optimal primary-backup protocols.