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.
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.
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.
EUR 33,96 für den Versand von USA nach Deutschland
Versandziele, Kosten & DauerEUR 37,64 für den Versand von USA nach Deutschland
Versandziele, Kosten & DauerAnbieter: Reader's Corner, Inc., Raleigh, NC, USA
Hardcover. Zustand: Fine. 1st Edition. This is a fine, unmarked, hardcover first edition, second printing copy, no DJ, brown spine, 872 pages. MEDIA SHIPPING, extra for airmail or international shipping. Bestandsnummer des Verkäufers 107092
Anzahl: 1 verfügbar
Anbieter: Archives Books inc., Edmond, OK, USA
Hardcover. Zustand: Acceptable. Minor tear on spine. No markings on text. Historic Oklahoma Bookstore on Route 66. Packages shipped daily, Mon-Fri. Bestandsnummer des Verkäufers mon0000719592
Anzahl: 1 verfügbar
Anbieter: Bay State Book Company, North Smithfield, RI, USA
Zustand: good. The book is in good condition with all pages and cover intact, including the dust jacket if originally issued. The spine may show light wear. Pages may contain some notes or highlighting, and there might be a "From the library of" label. Boxed set packaging, shrink wrap, or included media like CDs may be missing. Bestandsnummer des Verkäufers BSM.PZ09
Anzahl: 1 verfügbar
Anbieter: BennettBooksLtd, North Las Vegas, NV, USA
hardcover. Zustand: New. In shrink wrap. Looks like an interesting title! Bestandsnummer des Verkäufers Q-1558603484
Anzahl: 1 verfügbar
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
Hardcover. Zustand: New. Bestandsnummer des Verkäufers 6666-ELS-9781558603486
Anzahl: Mehr als 20 verfügbar
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: New. pp. 904. Bestandsnummer des Verkäufers 7346126
Anzahl: 3 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Hardcover. Zustand: Brand New. 872 pages. 10.00x8.25x2.00 inches. In Stock. Bestandsnummer des Verkäufers __1558603484
Anzahl: 2 verfügbar
Anbieter: HPB-Red, Dallas, TX, USA
Hardcover. Zustand: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Bestandsnummer des Verkäufers S_438655698
Anzahl: 1 verfügbar
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Buch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 912 pp. Englisch. Bestandsnummer des Verkäufers 9781558603486
Anzahl: 2 verfügbar
Anbieter: Brook Bookstore On Demand, Napoli, NA, Italien
Zustand: new. Questo è un articolo print on demand. Bestandsnummer des Verkäufers 280b3392365d008652706b0f5ce3f15c
Anzahl: Mehr als 20 verfügbar