Jump to ratings and reviews
Rate this book

Distributed Algorithms for Message-Passing Systems

Rate this book
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.

534 pages, Paperback

First published June 29, 2013

Loading...
Loading...

About the author

Michel Raynal

20 books3 followers

Ratings & Reviews

What do you think?
Rate this book

Friends & Following

Create a free account to discover what your friends think of this book!

Community Reviews

5 stars
4 (40%)
4 stars
5 (50%)
3 stars
1 (10%)
2 stars
0 (0%)
1 star
0 (0%)
Displaying 1 - 1 of 1 review
Profile Image for Fred Hebert.
Author 4 books58 followers
January 30, 2014
I've just completed this book that a friend lent to me.

It's rather well-written and goes in depth on a lot of the basic (or rather foundational) concepts of distributed computing, and more advanced ones too.

It's approachable, although not as much if you have an aversion to mathematical notation, but it's possible to pull through by focusing on the pseudo code and descriptions.

An annoying thing about the book is that it never ever mentions failures, time outs, and network issues in distributed algorithms. I went the entire book thinking that nearly none of the material in there was of practical use.

Then you go to the afterword, after 470 pages of content and algorithm reading, down to the section "A Series of Books" where it is suddenly revealed to you that the book's purpose was in fact to have algorithms about failure-free asynchronous systems (these things don't really exist, they're always failure prone in some way! They're more of a mental framework to explore the algorithms themselves)

The author does recommend alternative books to get that content, but hot damn would I have liked to know about it beforehand, maybe in the preface or something, given there is one already.

This has been a huge disappointment regarding my expectations, but after learning about this point of view the book has set itself for, I can see the book doing a very good job at it. It's why I still give it 4 stars.
Displaying 1 - 1 of 1 review