Distributed Computing: Principles, Algorithms, and SystemsCambridge University Press, 2011. gada 3. marts Designing distributed computing systems is a complex process requiring a solid understanding of the design problems and the theoretical and practical aspects of their solutions. This comprehensive textbook covers the fundamental principles and models underlying the theory, algorithms and systems aspects of distributed computing. Broad and detailed coverage of the theory is balanced with practical systems-related issues such as mutual exclusion, deadlock detection, authentication, and failure recovery. Algorithms are carefully selected, lucidly presented, and described without complex proofs. Simple explanations and illustrations are used to elucidate the algorithms. Important emerging topics such as peer-to-peer networks and network security are also considered. With vital algorithms, numerous illustrations, examples and homework problems, this textbook is suitable for advanced undergraduate and graduate students of electrical and computer engineering and computer science. Practitioners in data networking and sensor networks will also find this a valuable resource. Additional resources are available online at www.cambridge.org/9780521876346. |
Saturs
| 1 | |
| 39 | |
| 50 | |
Global state and snapshot recording algorithms | 87 |
Terminology and basic algorithms | 126 |
Message ordering and group communication | 189 |
Termination detection | 241 |
Reasoning with knowledge | 282 |
Global predicate detection | 379 |
Distributed shared memory | 410 |
Checkpointing and rollback recovery | 456 |
Consensus and agreement algorithms | 510 |
Failure detectors | 567 |
Authentication in distributed systems | 598 |
Selfstabilization | 631 |
Peertopeer computing and overlay graphs | 677 |
Distributed mutual exclusion algorithms | 305 |
Deadlock detection in distributed systems | 352 |
Index | 731 |
Citi izdevumi - Skatīt visu
Distributed Computing: Principles, Algorithms, and Systems Ajay D. Kshemkalyani,Mukesh Singhal Priekšskatījums nav pieejams - 2011 |
Distributed Computing: Principles, Algorithms, and Systems Ajay D. Kshemkalyani,Mukesh Singhal Priekšskatījums nav pieejams - 2008 |
Bieži izmantoti vārdi un frāzes
application assume asynchronous system atomic authentication boolean broadcast causal order channel checkpoint communication complexity concurrent consistent global consistent snapshot control message correct process crash critical section deadlock detection defined denoted detection algorithm distributed algorithms distributed computation distributed system edges encrypted example execution Exercise failure detector FIFO Figure global snapshot graph Hence identifier implementation initiator integer Lamport linearizable logical clock matrix clocks message-passing messages sent metagroup multicast mutual exclusion algorithm neighbors node number of messages object path piggybacked predicate process Pi processors propagation protocol query queue recorded recovery REPLY message REQUEST message requires rollback root round routing scale-free networks self-stabilizing sender sequence number sequential consistency server shared memory shown snapshot algorithm spanning tree Steiner tree step synchronous terminating reliable broadcast termination detection timestamp token topology total order updated variables vector clocks wait-free
Populāri fragmenti
253. lappuse - A join query graph can be denoted by a graph G = (V, E), where V is the set of nodes and E is the set of edges.
730. lappuse - Kubiatowicz: Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 22 (2004): 41-53 8.
298. lappuse - Definition 8.8 adopts the convention that a process chain lists the processes in an order which is the reverse of the order in which they send the messages in the corresponding message chain.
124. lappuse - Department of Computer and Information Science The Ohio State University, Columbus, OH 43210.
455. lappuse - K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and JL Hennessy. Memory consistency and event ordering in scalable sharedmemory multiprocessors.
454. lappuse - Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit, Atomic snapshots of shared memory, in "Proceedings of the 9th ACM Symposium on Principles of Distributed Computing,
459. lappuse - Introduction A local checkpoint is a snapshot of a local state of a process...
408. lappuse - VK Garg and B. Waldecker. Detection of weak unstable predicates in distributed programs.