Authors:
- Constitutes an introduction to distributed computing
- Author among the leading researchers in the area of distributed computing
- Textbook features include summaries, keywords, bibliographic notes and exercises for each chapter
- Includes supplementary material: sn.pub/extras
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (17 chapters)
-
Front Matter
-
Logical Time and Global States in Distributed Systems
-
Front Matter
-
-
Mutual Exclusion and Resource Allocation
-
Front Matter
-
-
High-Level Communication Abstractions
-
Front Matter
-
-
Detection of Properties on Distributed Executions
-
Front Matter
-
About this book
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.
Keywords
Reviews
“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)
Authors and Affiliations
-
IRISA-ISTIC, Université de Rennes 1, Institut Universitaire de France, Rennes Cedex, France
Michel Raynal
About the author
Bibliographic Information
Book Title: Distributed Algorithms for Message-Passing Systems
Authors: Michel Raynal
DOI: https://doi.org/10.1007/978-3-642-38123-2
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2013
Hardcover ISBN: 978-3-642-38122-5Published: 10 July 2013
Softcover ISBN: 978-3-642-43743-4Published: 30 July 2015
eBook ISBN: 978-3-642-38123-2Published: 29 June 2013
Edition Number: 1
Number of Pages: XXXI, 500
Topics: Theory of Computation, Computer Communication Networks, Programming Techniques, Computer Hardware