Amazon cover image
Image from Amazon.com

Distributed algorithms : 6th international workshop, WDAG '92, Haifa, Israel, November 2-4, 1992 : proceedings / A. Segall, S. Zaks, eds.

Contributor(s): Material type: TextTextSeries: Lecture notes in computer science ; 647.Publisher: Berlin ; New York : Springer-Verlag, ©1992Description: 1 online resource (x, 378 pages)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540474845
  • 3540474846
Subject(s): Genre/Form: Additional physical formats: Print version:: No titleDDC classification:
  • 004/.36/015118 20
LOC classification:
  • QA76.9.D5 D4854 1992
Other classification:
  • 54.32
  • 28
Online resources:
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.
Action note:
  • digitized 2013 HathiTrust Digital Library committed to preserve
Summary: "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
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

"The Sixth Workshop on Distributed Algorithms (WDAG 92)"--Preface

Includes bibliographical references.

"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

Use copy Restrictions unspecified star MiAaHDL

Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2013. MiAaHDL

Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL

http://purl.oclc.org/DLF/benchrepro0212

digitized 2013 HathiTrust Digital Library committed to preserve pda MiAaHDL

Print version record.

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.

Powered by Koha