Distributed Algorithms: 6th International Workshop, WDAG '92, Haifa, Israel, November 2-4, 1992 : Proceedings
"This volume presents the proceedings of the Sixth Workshop on Distributed Algorithms (WDAG 92), held in Haifa, Israel, November 2-4, 1992. WDAG provides a forum for researchers and other parties interested in distributedalgorithms and their applications. The aim is to present recent research results, explore directions for future research, and identify common fundamental techniques that serve as building blocks in many distributed algorithms. Papers in the volume describe original results in all areas of distributed algorithms and their applications, including distributed graph algorithms, distributed combinatorial algorithms, design of network protocols, routing and flow control, communication complexity, fault-tolerant distributed algorithms, distributed data structures, distributed database techniques, replica control protocols, distributed optimization algorithms, mechanisms for safety and security in distributed systems, and protocols for real-time distributed systems."--PUBLISHER'S WEBSITE.
What people are saying - Write a review
We haven't found any reviews in the usual places.
a paradigm for running distributed algorithms
Efficient atomic snapshots using lattice agreement
Choice coordination with multiple alternatives
6 other sections not shown
Other editions - View all
Distributed Algorithms: 6th International Workshop, Wdag '92, Haifa, Israel ...
Adrian Segall,Shmuel Zaks
No preview available - 2014
agreement algorithm assume atomic broadcast boolean busy-waiting Byzantine failures clock communication Computer Science concurrent configuration consensus protocol correct processor counting network crash failures defined delivered denote deterministic diffusion distributed algorithms Distributed Computing Dolev dynamic early-stopping end of round eventually stable execution fault-tolerance faulty links faulty processors F║efore hop counter hypercube implementation initial input k-CCP lattice agreement Lemma linearizable lower bound machines memory adaptive neighbors node non-faulty processors number of processors number of rounds omission failures operations optimal output paper partition path phase Proceedings Proof properties queue queue-number randomized randomized algorithm received registers reset scan schedule segment sends sequence sequentially consistent simulation snapshot object solve synchronous technique test-and-set Theorem time-stamp scheme token tuple topology total order tree update variable vertex virtual synchrony wait-free