"Distributed Algorithms for Message-Passing Systems" - Information and Links:

Distributed Algorithms for Message-Passing Systems - Info and Reading Options

Book's cover
The cover of “Distributed Algorithms for Message-Passing Systems” - Open Library.

"Distributed Algorithms for Message-Passing Systems" was published by Springer Berlin Heidelberg in 2013 - gw, it has 500 pages and the language of the book is English.


“Distributed Algorithms for Message-Passing Systems” Metadata:

  • Title: ➤  Distributed Algorithms for Message-Passing Systems
  • Author:
  • Language: English
  • Number of Pages: 500
  • Publisher: Springer Berlin Heidelberg
  • Publish Date:
  • Publish Location: gw

“Distributed Algorithms for Message-Passing Systems” Subjects and Themes:

Edition Specifications:

  • Format: [electronic resource] /
  • Pagination: ➤  XXXI, 500 p. 198 illus., 106 illus. in color.

Edition Identifiers:

AI-generated Review of “Distributed Algorithms for Message-Passing Systems”:


"Distributed Algorithms for Message-Passing Systems" Table Of Contents:

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

"Distributed Algorithms for Message-Passing Systems" Description:

The Open Library:

Distributed computing is at the heart of many applications. It arises as soon as one has to solve a problem in terms of entities -- such as processes, peers, processors, nodes, or agents --^ that individually have only a partial knowledge of the many input parameters associated with the problem. In particular each entity cooperating towards the common goal cannot have an instantaneous knowledge of the current state of the other entities. Whereas parallel computing is mainly concerned with 'efficiency', and real-time computing is mainly concerned with 'on-time computing', distributed computing is mainly concerned with 'mastering uncertainty' created by issues such as the multiplicity of control flows, asynchronous communication, unstable behaviors, mobility, and dynamicity. While some distributed algorithms consist of a few lines only, their behavior can be difficult to understand and their properties hard to state and prove. The aim of this book is to present in a comprehensive way the basic notions, concepts, and algorithms of distributed computing when the distributed entities cooperate by sending and receiving messages on top of an asynchronous network.^ The book is composed of seventeen chapters structured into six parts: distributed graph algorithms, in particular what makes them different from sequential or parallel algorithms; logical time and global states, the core of the book; mutual exclusion and resource allocation; high-level communication abstractions; distributed detection of properties; and distributed shared memory. The author establishes clear objectives per chapter and the content is supported throughout with illustrative examples, summaries, exercises, and annotated bibliographies. This book constitutes an introduction to distributed computing and is suitable for advanced undergraduate students or graduate students in computer science and computer engineering, graduate students in mathematics interested in distributed computing, and practitioners and engineers involved in the design and implementation of distributed applications. The reader should have a basic knowledge of algorithms and operating systems.

Read “Distributed Algorithms for Message-Passing Systems”:

Read “Distributed Algorithms for Message-Passing Systems” by choosing from the options below.

Search for “Distributed Algorithms for Message-Passing Systems” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Distributed Algorithms for Message-Passing Systems” in Libraries Near You:

Read or borrow “Distributed Algorithms for Message-Passing Systems” from your local library.

Buy “Distributed Algorithms for Message-Passing Systems” online:

Shop for “Distributed Algorithms for Message-Passing Systems” on popular online marketplaces.