Distributed Computing: Fundamentals, Simulations and Advanced TopicsMcGraw-Hill, 1998 - 451 strán (strany) |
Obsah
1 | 3 |
Causality and Time | 6 |
Basic Algorithms in Message Passing Systems | 9 |
Autorské práva | |
18 zvyšných častí nezobrazených
Časté výrazy a frázy
adjusted clock admissible execution assume asynchronous system block executions Byzantine failures causally checkHS computation event consensus algorithm consensus object consensus problem Consider contradiction convergecast crash failures critical section defined distributed algorithms distributed computing enter the critical entry section Exercise faulty processors FIFO Figure flooding algorithm hardware clock identical Byzantine identifier implies inductive initial configuration input k-th leader election algorithm Lemma linearizability lower bound message complexity message delays message passing systems messages sent multi-reader neighbors node nonfaulty processor number of messages number of processors order equivalent p₁ parent phase pi's processor pi proof prove pseudocode appears randomized randomized algorithm read/write registers requires returns ring schedule sends sequence number sequential consistency shared memory systems shared variables simulated processor single-writer snapshot object solve spanning tree specific step synchronous ring termination Theorem totally ordered traceable register tryHS tw₁ vector timestamp