Distributed algorithms : 8th International Workshop, WDAG '94, Terschelling, The Netherlands, September 29-October 1, 1994 : proceedings
Author(s)
Bibliographic Information
Distributed algorithms : 8th International Workshop, WDAG '94, Terschelling, The Netherlands, September 29-October 1, 1994 : proceedings
（Lecture notes in computer science, 857）
Springer-Verlag, c1994
- : Berlin
- : New York
Available at 53 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
: BerlinL/N||LNCS||85794049359
Note
Includes bibliographical references and index
Description and Table of Contents
Description
This volume presents the proceedings of the 8th International Workshop on Distributed Algorithms (WDAG '94), held on the island of Terschelling, The Netherlands in September 1994.
Besides the 23 research papers carefully selected by the program committee, the book contains 3 invited papers. The volume covers all relevant aspects of distributed algorithms; the topics discussed include network protocols, distributed control and communication, real-time systems, dynamic algorithms, self-stabilizing algorithms, synchronization, graph algorithms, wait-free algorithms, mechanisms for security, replicating data, and distributed databases.
Table of Contents
Replicated file management in large-scale distributed systems.- Realization of PRAMs: Processor design.- Factoring.- Primary partition "Virtually-synchronous communication" harder than consensus.- Secure distributed computing: Theory and practice.- Fast increment registers.- Coping with contention.- Exotic behaviour of consensus numbers.- Space-optimum conflict-free construction of 1-writer 1-reader multivalued atomic variable.- Linear-time snapshot using multi-writer multi-reader registers.- Fast, long-lived renaming.- Anomalies in the wait-free hierarchy.- Finding the extrema of a distributed multiset.- The level of handshake required for establishing a connection.- Local labeling and resource allocation using preprocessing.- A scalable approach to routing in ATM networks.- Low complexity network synchronization.- An incremental distributed algorithm for computing biconnected components.- Reaching (and maintaining) agreement in the presence of mobile faults.- Uniform deterministic self-stabilizing ring-orientation on odd-length rings.- Using failure detectors to solve consensus in asynchronous shared-memory systems.- An algorithm with optimal failure locality for the dining philosophers problem.- Average and randomized complexity of distributed problems.- Self-stabilization by local checking and global reset.- Breakpoints and time in distributed computations.- Cheaper matrix clocks.
by "Nielsen BookData"