Produktbild: Distributed Algorithms for Message-Passing Systems

Distributed Algorithms for Message-Passing Systems

63,99 €

inkl. gesetzl. MwSt., Versandkostenfrei


Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

30.07.2015

Abbildungen

XXXI, 500 p.

Verlag

Springer Berlin

Seitenzahl

500

Maße (L/B/H)

23,5/15,5/2,9 cm

Gewicht

797 g

Auflage

Softcover reprint of the original 1st ed. 2013

Sprache

Englisch

ISBN

978-3-642-43743-4

Beschreibung

Rezension

“The aim of this book is to present in a comprehensive way basic notions, concepts, and algorithms of distributed computing when the distributed entities cooperate by sending and receiving messages on top of an underlying network. … This book is useful for senior-level undergraduate students and graduate students in computer science with basic knowledge of algorithms and operating systems.” (T. C. Mohan, Mathematical Reviews, November, 2015)

“This book offers balanced coverage of the major topics encountered in courses on modern distributed computations. The text is primarily intended for courses on distributed systems; it can be used for both undergraduate and postgraduate courses. … Overall, this title is an instructive and valuable book that deserves to be studied.” (Dimitrios Katsaros, Computing Reviews, June, 2014)

“The book presents in well structured manner the basic concepts and algorithms currently used in distributed systems based on message passing. … The book can be used as textbook by undergraduate students in distributed systems. What distinguishes this book from similar ones are the text accessibility and the well organization of a classical material. Many figures and pseudo-codes are helping the understanding of the algorithms.” (Dana Petcu, zbMATH, Vol. 1282, 2014)

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

30.07.2015

Abbildungen

XXXI, 500 p.

Verlag

Springer Berlin

Seitenzahl

500

Maße (L/B/H)

23,5/15,5/2,9 cm

Gewicht

797 g

Auflage

Softcover reprint of the original 1st ed. 2013

Sprache

Englisch

ISBN

978-3-642-43743-4

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: GPSR Kontakt

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)

  • Produktbild: Distributed Algorithms for Message-Passing Systems
  • 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.