Distributed Computing: Fundamentals, Simulations, and Advanced TopicsJohn Wiley & Sons, 25 mrt 2004 - 432 pagina's * Comprehensive introduction to the fundamental results in the mathematical foundations of distributed computing * Accompanied by supporting material, such as lecture notes and solutions for selected exercises * Each chapter ends with bibliographical notes and a set of exercises * Covers the fundamental models, issues and techniques, and features some of the more advanced topics |
Inhoudsopgave
I | 7 |
II | 13 |
III | 15 |
V | 37 |
VII | 65 |
X | 97 |
XII | 131 |
XIII | 161 |
XX | 213 |
XXII | 245 |
XXIV | 257 |
XXVI | 283 |
XXVIII | 301 |
XXX | 303 |
XXXI | 327 |
XXXIII | 349 |
Overige edities - Alles bekijken
Distributed Computing: Fundamentals, Simulations, and Advanced Topics Hagit Attiya,Jennifer Welch Fragmentweergave - 2004 |
DISTRIBUTED COMPUTING: FUNDAMENTALS, SIMULATIONS AND ADVANCED TOPICS, 2ND ED Attiya Geen voorbeeld beschikbaar - 2006 |
Veelvoorkomende woorden en zinsdelen
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 Lemma linearizability lower bound message complexity message delays message-passing systems messages sent multicast node nonfaulty processor number of messages number of processors omission failures p₁ phase number pi's processor pi processor receives proof prove pseudocode 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 wait-free simulation write operation
Populaire passages
Pagina 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.
Verwijzingen naar dit boek
Distributed Computing: 16th International Conference, DISC 2002 ..., Volume 16 Dahlia Malkhi Geen voorbeeld beschikbaar - 2002 |