An optimal synchronizer for the hypercube

David Peleg, Jeffrey D. Ullman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

86 Scopus citations

Abstract

The synchronizer is a simulation methodology introduced by Awerbuch [Al] for simulating a synchronous network by an asynchronous one, thus enabling the execution of a synchronous algorithm on an asynchronous network. In this paper we present a novel technique for constructing network synchronizers. This technique is developed from some basic relationships between synchronizers and the structure of a t-spanning subgraph over the network. As a special result, we obtain a synchronizer for the hyper-cube with optimal time and communication complexities.

Original languageEnglish
Title of host publicationProceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, PODC 1987
EditorsFred B. Schneider
PublisherAssociation for Computing Machinery
Pages77-85
Number of pages9
ISBN (Electronic)089791239X
DOIs
StatePublished - 1 Dec 1987
Externally publishedYes
Event6th Annual ACM Symposium on Principles of Distributed Computing, PODC 1987 - Vancouver, Canada
Duration: 10 Aug 198712 Aug 1987

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing
VolumePart F130235

Conference

Conference6th Annual ACM Symposium on Principles of Distributed Computing, PODC 1987
Country/TerritoryCanada
CityVancouver
Period10/08/8712/08/87

Bibliographical note

Publisher Copyright:
© 1987 ACM.

Fingerprint

Dive into the research topics of 'An optimal synchronizer for the hypercube'. Together they form a unique fingerprint.

Cite this