Distributed Algorithms 6th International Workshop, WDAG '92, Haifa, Israel, November 2-4, 1992. Proceedings

Distributed Algorithms 6th International Workshop, WDAG '92, Haifa, Israel, November 2-4, 1992. Proceedings / edited by Adrian Segall, Shmuel Zaks.

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...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Segall, Adrian (Editor), Zaks, Shmuel (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1992.
Edition:1st ed. 1992.
Series:Lecture Notes in Computer Science, 647
Springer eBook Collection.
Subjects:
Computers.
Computer programming.
Algorithms.
Computer communication systems.
Operating systems (Computers).
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • 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.

Similar Items