Distributed Computing: Fundamentals, Simulations, and Advanced TopicsWiley, 25. 3. 2004 - 414 strán (strany) * 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 |
Vyhľadávanie v obsahu knihy
Výsledky 1 - 3 z 29.
Strana 121
... validity condition ( every nonfaulty deci- sion is some nonfaulty input ) for Byzantine failures , n must be greater ... validity condition of Exercise 5.12 . 5.14 Assuming n is sufficiently large , modify the polynomial message ...
... validity condition ( every nonfaulty deci- sion is some nonfaulty input ) for Byzantine failures , n must be greater ... validity condition of Exercise 5.12 . 5.14 Assuming n is sufficiently large , modify the polynomial message ...
Strana 279
... validity condition states that the change in the adjusted clock since the beginning of the execution must be within ... validity condition is stated with respect to the hardware clocks , not real time . However , as Exercise 13.2 asks ...
... validity condition states that the change in the adjusted clock since the beginning of the execution must be within ... validity condition is stated with respect to the hardware clocks , not real time . However , as Exercise 13.2 asks ...
Strana 280
... validity condition with parameter y for a set of processors , then the same is true in a ' = scale ( a , s ) , for ... validity condition for processor p1 . By Lemma 13.1 ( b ) , for all times t : AC ( t ) - AC ( 0 ) = AC ; ( t / s ) ...
... validity condition with parameter y for a set of processors , then the same is true in a ' = scale ( a , s ) , for ... validity condition for processor p1 . By Lemma 13.1 ( b ) , for all times t : AC ( t ) - AC ( 0 ) = AC ; ( t / s ) ...
Iné vydania - Zobraziť všetky
Časté výrazy a frázy
adjusted clock admissible execution assume asynchronous system block executions broadcast service Byzantine failures causally chapter notes clock synchronization code for processor communication system computation event condition consensus algorithm consensus object consensus problem Consider contradiction crash failures critical section defined definition distributed shared memory enter the critical Exercise failure detector faulty processors FIFO hardware clock identical Byzantine identifier implies inductive Lemma linearizability lower bound message delays message-passing systems messages sent multicast node nonfaulty processor number of messages number of processors omission failures output p₁ phase number pi's processor decides processor pi processor receives proof prove randomized randomized algorithm read/write objects read/write registers requires returns ring round k scan sequence number sequential consistency shared memory systems shared objects shared variables simulating processor single-writer snapshot object solve consensus synchronous ring termination Theorem totally ordered update validity vector clock wait-free simulation write operation