Distributed Algorithms for Message-Passing Systems

By Michel Raynal

Book Overview

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.

• Format: Paperback
• Language: English
• ISBN: 3642437435
• ISBN13: 9783642437434
• Release Date: July 2015
• Publisher: Springer
• Length: 500 Pages
• Weight: 1.63 lbs.
• Dimensions: 1.1" x 6.1" x 9.2"