Distributed Algorithms for Message-Passing Systems
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 p...
| Κύριος συγγραφέας: | |
|---|---|
| Συγγραφή απο Οργανισμό/Αρχή: | |
| Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
| Γλώσσα: | English |
| Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2013.
|
| Θέματα: | |
| Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- 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.
