Distributed Algorithms
6th International Workshop, WDAG '92, Haifa, Israel, November 2-4, 1992. Proceedings
Published on 15. October 1992
Book
Paperback/Softback
X, 382 pages
978-3-540-56188-0 (ISBN)
Description
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.
More details
Series
Edition
1992 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
X, 382 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 22 mm
Weight
598 gr
ISBN-13
978-3-540-56188-0 (9783540561880)
DOI
10.1007/3-540-56188-9
Schweitzer Classification
Content
Sparser: A paradigm for running distributed algorithms.- Closed schedulers: Constructions and applications to consensus protocols.- Efficient atomic snapshots using lattice agreement.- Choice coordination with multiple alternatives (preliminary version).- Some results on the impossibility, universality, and decidability of consensus.- Wait-free test-and-set.- A concurrent time-stamp scheme which is linear in time and space.- Tentative and definite distributed computations: An optimistic approach to network synchronization.- Semisynchrony and real time.- Optimal time Byzantine agreement for t /8 with linear messages.- A continuum of failure models for distributed computing.- Simulating crash failures with many faulty processors (extended abstract).- An efficient topology update protocol for dynamic networks.- Memory adaptive self-stabilizing protocols (extended abstract).- Optimal early stopping in distributed consensus.- Traffic-light scheduling on the grid.- Distributed computing on anonymous hypercubes with faulty components.- Message terminate algorithms for anonymous rings of unknown size.- Distributed resource allocation algorithms.- Membership algorithms for multicast communication groups.- The granularity of waiting (extended Abstract).- The cost of order in asynchronous systems.- Efficient, strongly consistent implementations of shared memory.- Optimal primary-backup protocols.