Distributed Algorithms: 6th International Workshop, WDAG '92, Haifa, Israel, November 2-4, 1992. Proceedings by Adrian SegallDistributed Algorithms: 6th International Workshop, WDAG '92, Haifa, Israel, November 2-4, 1992. Proceedings by Adrian Segall

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

EditorAdrian Segall, Shmuel Zaks

Paperback | October 15, 1992

Pricing and Purchase Info

$128.05 online 
$141.95 list price save 9%
Earn 640 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.
Title:Distributed Algorithms: 6th International Workshop, WDAG '92, Haifa, Israel, November 2-4, 1992…Format:PaperbackDimensions:388 pagesPublished:October 15, 1992Publisher:Springer Berlin HeidelbergLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540561889

ISBN - 13:9783540561880

Look for similar items by category:

Reviews

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.