Distributed Computing: Fundamentals, Simulations, and Advanced Topics
The explosive growth of distributed computing systems makes understanding them imperative. To make this notoriously difficult subject accessible, 'Distributed Computing; Fundamentals, Simulations, and Advanced Topics; Second Edition', provides a solid introduction to the mathematical foundations and theory of distributed computing, highlighting common themes and basic techniques. The authors present the fundamental issues underlying the design of distributed systems - communication, coordination, synchronization, and uncertainty - as well as fundamental algorithmic concepts and lower-bound techniques. The book’s unifying approach emphasizes the similarities between different models and explains inherent discrepancies between them.
Čo hovoria ostatní - Napísať recenziu
Na obvyklých miestach sme nenašli žiadne recenzie.
Iné vydania - Zobraziť všetky
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Hagit Attiya,Jennifer Welch
Zobrazenie úryvkov - 1998
Distributed computing: fundamentals, simulations, and advanced topics
Hagit Attiya,Jennifer Welch
Zobrazenie úryvkov - 2004
0-valent adjusted clock admissible execution assume asynchronous system block executions broadcast service Byzantine failures causally clock synchronization code for processor communication system computation event condition consensus algorithm consensus object consensus problem Consider contradiction crash failures critical section definition distributed computing distributed shared memory enter the critical Exercise failure detector faulty processors FIFO flooding algorithm hardware clock identical Byzantine identifier implies inductive initial configuration Lemma linearizability lower bound message complexity message delays message-passing systems messages sent multicast mutual exclusion algorithm node nonfaulty processor number of messages number of processors omission failures phase number processor PJ processor receives proof prove randomized randomized algorithm read/write objects read/write registers requires returns ring scan sequence number sequential consistency shared memory systems shared objects shared variables simulating processor single-writer snapshot object solve consensus spanning tree specification synchronous ring termination Theorem totally ordered update validity vector clock wait-free simulation write operation
Strana 2 - each computing entity can only be aware of information that it acquires, it has only a local view of the global situation. Computing entities can fail independently, leaving some components operational while others are not. The explosive growth of distributed systems makes it imperative to understand how to overcome these difficulties.