Distributed Computing: Fundamentals, Simulations, and Advanced TopicsWiley, 25. 3. 2004 - 432 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 69.
Strana 195
... write operation . When p ; receives an update message , it writes the new value to its local copy of the object . If the update message was originated by pi , then pi generates an ack and the ( unique pending ) write operation returns ...
... write operation . When p ; receives an update message , it writes the new value to its local copy of the object . If the update message was originated by pi , then pi generates an ack and the ( unique pending ) write operation returns ...
Strana 221
... write , ( R , v ) occurs : // writer pu writes v to register R , 0 ≤ w ≤ m − 1 ts : = NewCTS ( ) Val [ w ] ... operation in turn , in the order in which its response occurs in a . A read operation that returns a value associated with ...
... write , ( R , v ) occurs : // writer pu writes v to register R , 0 ≤ w ≤ m − 1 ts : = NewCTS ( ) Val [ w ] ... operation in turn , in the order in which its response occurs in a . A read operation that returns a value associated with ...
Strana 230
... write operation communicates with a set of at least 32 ] + 1 processors , which is a majority of the processors . Thus there is at least one processor in the intersection of the subsets for each read and write operation . This ...
... write operation communicates with a set of at least 32 ] + 1 processors , which is a majority of the processors . Thus there is at least one processor in the intersection of the subsets for each read and write operation . This ...
Iné vydania - Zobraziť všetky
Časté výrazy a frázy
adjusted clock admissible execution assume asynchronous system bc-recv block executions broadcast service Byzantine failures causally chapter notes clock synchronization code for processor common coin 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 faulty processors FIFO flooding algorithm hardware clock identifier implies Lemma linearizability lower bound message delays message-passing systems messages sent multicast node nonfaulty processor number of processors omission failures output p₁ phase pi's pj's processor decides processor pi processor receives proof properties prove pseudocode pseudocode appears R₁ 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 spanning tree specification synchronous ring termination Theorem totally ordered update validity vector clock vector timestamp wait-free simulation write operation