Distributed Computing: Fundamentals, Simulations and Advanced TopicsMcGraw-Hill, 1998 - 451 strán (strany) |
Obsah
1 | 3 |
Basic Algorithms in Message Passing Systems | 9 |
Leader Election in Rings | 33 |
Autorské práva | |
18 zvyšných častí nezobrazených
Časté výrazy a frázy
admissible execution algorithm appears applied assume broadcast Byzantine called Chapter clock cluster communication complexity computation condition configuration consensus Consider consistent construct contains contradiction cover crash critical section decide defined definition delay describe distributed election enter the critical entry equal event execution Exercise exists failures faulty Figure formal identifier implies indicates initial input later leader least Lemma Line lower bound message passing mutual exclusion neighbors node nonfaulty processor Note object occurs operation p₁ pair parent performs phase possible presented problem procedure proof prove provides randomized received record registers requires result returns ring root round satisfies schedule sends sent sequence sequential consistency shared memory simple simulation single solve spanning specific step Suppose synchronous takes termination Theorem timestamp tree true validity variables vector wait-free write