Verwandte Artikel zu Distributed Algorithms (The Morgan Kaufmann Series...

Distributed Algorithms (The Morgan Kaufmann Series in Data Management Systems) - Hardcover

 
9781558603486: Distributed Algorithms (The Morgan Kaufmann Series in Data Management Systems)

Inhaltsangabe

In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing, and analyzing distributed algorithms. She directs her book at a wide audience, including students, programmers, system designers, and researchers. Distributed Algorithms contains the most significant algorithms and impossibility results in the area, all in a simple automata-theoretic setting. The algorithms are proved correct, and their complexity is analyzed according to precisely defined complexity measures. The problems covered include resource allocation, communication, consensus among distributed processes, data consistency, deadlock detection, leader election, global snapshots, and many others. The material is organized according to the system model―first by the timing model and then by the interprocess communication mechanism. The material on system models is isolated in separate chapters for easy reference. The presentation is completely rigorous, yet is intuitive enough for immediate comprehension. This book familiarizes readers with important problems, algorithms, and impossibility results in the area: readers can then recognize the problems when they arise in practice, apply the algorithms to solve them, and use the impossibility results to determine whether problems are unsolvable. The book also provides readers with the basic mathematical tools for designing new algorithms and proving new impossibility results. In addition, it teaches readers how to reason carefully about distributed algorithms―to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Über die Autorin bzw. den Autor

About the author: Nancy A. Lynch is a professor of electrical engineering and computer science at MIT and heads MIT's Theory of Distributed Systems research group. She is the author of numerous research articles about distributed algorithms and impossibility results, and about formal modeling and verification of distributed systems.

Von der hinteren Coverseite

In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing, and analyzing distributed algorithms. She directs her book at a wide audience, including students, programmers, system designers, and researchers.



Distributed Algorithms contains the most significant algorithms and impossibility results in the area, all in a simple automata-theoretic setting. The algorithms are proved correct, and their complexity is analyzed according to precisely defined complexity measures. The problems covered include resource allocation, communication, consensus among distributed processes, data consistency, deadlock detection, leader election, global snapshots, and many others.



The material is organized according to the system model—first by the timing model and then by the interprocess communication mechanism. The material on system models is isolated in separate chapters for easy reference.



The presentation is completely rigorous, yet is intuitive enough for immediate comprehension. This book familiarizes readers with important problems, algorithms, and impossibility results in the area: readers can then recognize the problems when they arise in practice, apply the algorithms to solve them, and use the impossibility results to determine whether problems are unsolvable. The book also provides readers with the basic mathematical tools for designing new algorithms and proving new impossibility results. In addition, it teaches readers how to reason carefully about distributed algorithms—to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

  • VerlagMorgan Kaufmann Publishers In
  • Erscheinungsdatum1996
  • ISBN 10 1558603484
  • ISBN 13 9781558603486
  • EinbandTapa dura
  • SpracheEnglisch
  • Anzahl der Seiten912
  • Kontakt zum HerstellerNicht verfügbar

EUR 11,68 für den Versand von Vereinigtes Königreich nach Deutschland

Versandziele, Kosten & Dauer

Weitere beliebte Ausgaben desselben Titels

9780123954541: Distributed Algorithms (The Morgan Kaufmann Series in Data Management Systems)

Vorgestellte Ausgabe

ISBN 10:  0123954541 ISBN 13:  9780123954541
Verlag: Morgan Kaufmann Publishers In, 1996
Softcover

Suchergebnisse für Distributed Algorithms (The Morgan Kaufmann Series...

Beispielbild für diese ISBN

Nancy A. Lynch
Verlag: Morgan Kaufmann Pub, 1997
ISBN 10: 1558603484 ISBN 13: 9781558603486
Neu Hardcover

Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich

Verkäuferbewertung 5 von 5 Sternen 5 Sterne, Erfahren Sie mehr über Verkäufer-Bewertungen

Hardcover. Zustand: Brand New. 872 pages. 10.00x8.25x2.00 inches. In Stock. Artikel-Nr. __1558603484

Verkäufer kontaktieren

Neu kaufen

EUR 145,99
Währung umrechnen
Versand: EUR 11,68
Von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & Dauer

Anzahl: 2 verfügbar

In den Warenkorb