Distributed Systems: An Algorithmic ApproachCRC Press, 22 нояб. 2006 г. - Всего страниц: 424 Most applications in distributed computing center around a set of common subproblems. Distributed Systems: An Algorithmic Approach presents the algorithmic issues and necessary background theory that are needed to properly understand these challenges. Achieving a balance between theory and practice, this book bridges the gap betwee |
Содержание
Chapter 1 Introduction | 3 |
An Overview | 13 |
Foundational Topics | 35 |
Chapter 3 Models of Communication | 37 |
Syntax and Semantics | 55 |
Chapter 5 Program Correctness | 69 |
Chapter 6 Time in a Distributed System | 89 |
Important Paradigms | 103 |
Chapter 13 Distributed Consensus | 209 |
Chapter 14 Distributed Transactions | 227 |
Chapter 15 Group Communication | 243 |
Chapter 16 Replicated Data Management | 263 |
Chapter 17 SelfStabilizing Systems | 281 |
Real World Issues | 301 |
Chapter 18 Distributed DiscreteEvent Simulation | 303 |
Chapter 19 Security in Distributed Systems | 313 |
Chapter 7 Mutual Exclusion | 105 |
Chapter 8 Distributed Snapshot | 127 |
Chapter 9 Global State Collection | 137 |
Chapter 10 Graph Algorithms | 151 |
Chapter 11 Coordination Algorithms | 173 |
Faults and FaultTolerant Systems | 189 |
Chapter 12 FaultTolerant Systems | 191 |
Chapter 20 Sensor Networks | 339 |
Chapter 21 PeertoPeer Networks | 363 |
| 383 | |
| 393 | |
Back cover | 403 |
Другие издания - Просмотреть все
Часто встречающиеся слова и выражения
acknowledgment action algorithm applications Assume atomic behavior broadcast byzantine failures called causal order channel ciphertext client color communication complete computation concurrent Consider consistency coordinator copy critical section deadlock define detection distributed system edge encryption example execution failure detector fault fault-tolerance FIFO Figure fragment global Gnutella graph guarantee guard implementation initial integer Internet layer leader linearizability logical logical clock machine message complexity message-passing mutual exclusion Napster neighbors nonfaulty operation order multicast packet phase plaintext planar graph problem processor Proof propagation delay protocol query received replicas request requires reset router routing table scheduler sender sensor networks sensor nodes sent sequence number sequential consistency serializability server shared shared-memory signals simulation snapshot snapshot algorithm solution spanning tree steps synchronization termination Theorem tick timestamp token topology total order transaction updates users variable vector clock wireless sensor networks