Adrian Segall / Shmuel Zaks (eds.)

Distributed Algorithms

6th International Workshop, WDAG '92, Haifa, Israel, November 2-4, 1992. Proceedings
Mitarbeit:Segall, Adrian; Zaks, Shmuel

• Broschiertes Buch

Produktbeschreibung

This volume presents the proceedings of the Sixth Workshopon Distributed Algorithms (WDAG 92), held in Haifa, Israel,November 2-4, 1992. WDAG provides a forum for researchersand other parties interested in distributedalgorithms andtheir applications. The aim is to present recent researchresults, explore directions for future research, andidentify common fundamental techniques that serve asbuilding blocks in many distributed algorithms.Papers in the volume describe original results in all areasof distributed algorithms and their applications, includingdistributed graph algorithms, distributed combinatorialalgorithms, design of network protocols, routing and flowcontrol, communication complexity, fault-tolerantdistributed algorithms, distributed data structures,distributed database techniques, replica control protocols,distributed optimization algorithms, mechanisms for safetyand security in distributed systems, and protocols forreal-time distributed systems.

Produktdetails

• Lecture Notes in Computer Science 647
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-56188-0
• 1992.
• Seitenzahl: 396
• Erscheinungstermin: 15. Oktober 1992
• Englisch
• Abmessung: 235mm x 155mm x 22mm
• Gewicht: 568g
• ISBN-13: 9783540561880
• ISBN-10: 3540561889
• Artikelnr.: 09250244

Inhaltsangabe

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.