Distributed Algorithms: International Workshop ... ProceedingsSpringer-Verlag, 1992 - Computer algorithms |
Contents
a paradigm for running distributed algorithms | 1 |
Efficient atomic snapshots using lattice agreement | 35 |
Choice coordination with multiple alternatives | 54 |
Copyright | |
6 other sections not shown
Other editions - View all
Common terms and phrases
agreement algorithm assume atomic broadcast Awerbuch boolean busy-waiting Byzantine failures clock communication Computer Science concurrent configuration consensus problem consensus protocol correct processor counting network crash failures defined delivered denote deterministic distributed algorithms Distributed Computing Dolev dynamic early-stopping end of round eventually stable execution fault-tolerance faulty links faulty processors Fbefore hop counter hypercube implementation initial input k-CCP lattice agreement Lemma linearizable lower bound machines memory adaptive message complexity neighbors node non-faulty processors number of processors number of rounds omission failures operations optimal output paper partition path phase Proc Proof properties queue queue-number randomized received registers reset scan schedule segment self-stabilizing sends a message sequence sequentially consistent simulation snapshot object solve synchronous technique test-and-set Theorem time-stamp scheme Tn,t token tuple total order tree variable vertex virtual synchrony wait-free