SIAM Journal on Computing · 1989 · 347 citations · 7 references
ComputingComputer EngineeringComputer ScienceComputer NetworksInterconnection NetworksParallel ComputingData SynchronizationGraph AlgorithmsHypercube NetworksNetwork TopologyAsynchronous ProcessingHypercube Network Communication ComplexityHypercube TopologyNetwork SynchronizationParallel Algorithms On HypercubesSynchronization On NetworksSynchronizer DesignSynchronizers
The synchronizer is a simulation methodology introduced by Awerbuch to simulate a synchronous network on an asynchronous one, enabling synchronous algorithms to run on asynchronous networks. This paper presents a novel technique for constructing network synchronizers. The technique derives from relationships between synchronizers and the structure of a t‑spanning subgraph over the network. A synchronizer for the hypercube with optimal time and communication complexities is obtained. Awerbuch, J.
The synchronizer is a simulation methodology introduced by Awerbuch [J. Assoc. Comput. Math., 32 (1985), pp. 804–823] for simulating a synchronous network by an asynchronous one, thus enabling the execution of a synchronous algorithm on an asynchronous network. In this paper a novel technique for constructing network synchronizers is presented. 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, a synchronizer for the hypercube with optimal time and communication complexities is obtained.
7
Computer-Aided Design · 1985 · 931 citations
Complexity of network synchronization
Baruch Awerbuch · Journal of the ACM · 1985 · 691 citations · Full text
The Indirect Binary n-Cube Microprocessor Array
Pease · IEEE Transactions on Computers · 1977 · 500 citations
David Peleg, Alejandro A. Schäffer · Journal of Graph Theory · 1989 · 419 citations