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 18.
Strana 190
... invocation invocation mcs mcs at po at pi mcs at Pn - 1 receive receive receive send send send network distributed shared memory Fig . 9.1 A memory consistency system . the MCS can decide on the response to an invocation using local ...
... invocation invocation mcs mcs at po at pi mcs at Pn - 1 receive receive receive send send send network distributed shared memory Fig . 9.1 A memory consistency system . the MCS can decide on the response to an invocation using local ...
Strana 191
... invocation . ' This condition imposes constraints on the inputs . The correct interaction property applies to all objects simultaneously , implying that a processor has to wait for a response from one object before submitting an invocation ...
... invocation . ' This condition imposes constraints on the inputs . The correct interaction property applies to all objects simultaneously , implying that a processor has to wait for a response from one object before submitting an invocation ...
Strana 208
... invocations and matching responses , beginning with an invocation . This condition imposes constraints on the inputs . Nonfaulty Liveness : Every invocation by a nonfaulty processor has a matching re- sponse . Extended Linearizability ...
... invocations and matching responses , beginning with an invocation . This condition imposes constraints on the inputs . Nonfaulty Liveness : Every invocation by a nonfaulty processor has a matching re- sponse . Extended Linearizability ...
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