Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Distributed Algorithms for Message-Passing Systems

BuchGebunden
500 Seiten
Englisch
Springererschienen am10.07.2013
Distributed Algorithms for Message-Passing Systemsmehr
Verfügbare Formate
BuchGebunden
EUR96,29
BuchKartoniert, Paperback
EUR69,54
E-BookPDF1 - PDF WatermarkE-Book
EUR69,54

Produkt

KlappentextDistributed Algorithms for Message-Passing Systems
ZusammenfassungThis book presents core concepts and algorithms of distributed computing, covering distributed graph algorithms; logical time and global states; mutual exclusion and resource allocation; high-level communication abstractions;distributed shared memory and more.
Details
ISBN/GTIN978-3-642-38122-5
ProduktartBuch
EinbandartGebunden
Verlag
Erscheinungsjahr2013
Erscheinungsdatum10.07.2013
Seiten500 Seiten
SpracheEnglisch
Gewicht924 g
IllustrationenXXXI, 500 p.
Artikel-Nr.28788304

Inhalt/Kritik

Inhaltsverzeichnis
Part I  Distributed Graph Algorithms.- Chap. 1  Base Definitions and Network Traversal Algorithms.- Chap. 2  Distributed Graph Algorithms.- Chap. 3  An Algorithmic Framework to Compute Global Functions on a Process Graph.- Chap. 4  Leader Election Algorithms.- Chap. 5  Mobile Objects Navigating a Network.- Part II  Logical Time and Global States in Distributed Systems.- Chap. 6  Nature of Distributed Computations and the Concept of a Global State.- Chap. 7  Logical Time in Asynchronous Distributed Systems.- Chap. 8  Asynchronous Distributed Checkpointing.- Chap. 9  Simulating Synchrony on Top of Asynchronous Systems.- Part III  Mutual Exclusion and Resource Allocation.- Chap. 10  Permission-Based Mutual Exclusion Algorithms.- Chap. 11  Distributed Resource Allocation.- Part IV  High-Level Communication Abstractions.- Chap. 12  Order Constraints on Message Delivery.- Chap. 13  Rendezvous and Synchronous Communication.- Part V  Detection of Properties on Distributed Executions.- Chap. 14  Distributed Termination Detection.- Chap. 15  Distributed Deadlock Detection.- Part VI  Distributed Shared Memory.- Chap. 16  Atomic Consistency (Linearizability).- Chap. 17  Sequential Consistency.- Afterword.- Bibliography.- Index.mehr

Schlagworte

Autor

Prof. Michel Raynal is among the top researchers in the world on the topic of distributed algorithms. He is a full professor at the Université de Rennes where he founded the Distributed Algorithms research group in 1984. He has been the principal investigator in numerous related research national and international projects, and he has been invited by more than 25 universities around the world to give lectures on distributed algorithms and distributed computing. He has over 300 academic publications on this topic, and has authored a number of books on related topics. His current research interests include distributed algorithms, distributed computing systems, distributed computability and dependability; and the fundamental principles that underlie the design and the construction of distributed computing systems.