A global time reference for hypercube multicomputers
This report describes a simple but effective technique for achieving a global time reference on hypercube multicomputers. The synchronization algorithm presented runs in O(log N) time where N = 2/sup n/ is the number of processors in an order n hypercube. Empirical evidence is given to show that the expected clock agreement is n/2 ticks. Since the synchronization algorithm does not depend on particular parameters of the underlying hardware, it is inherently portable. A sampling technique for testing the agreement of the processor clocks in O(N) time is also presented. This technique assumes that the internode message transit time, m, is constant but unknown. One unexpected outcome of this work was the discovery that, in general, timing information cannot be reliably obtained on the NCUBE/AT system except perhaps in the total absence of message traffic. 15 refs., 6 figs., 3 tabs.
- Research Organization:
- Virginia Univ., Charlottesville, VA (USA). Inst. for Parallel Computation
- DOE Contract Number:
- FG05-88ER25063
- OSTI ID:
- 6164260
- Report Number(s):
- DOE/ER/25063-T3; IPC-TR-88-10; ON: DE89010924
- Resource Relation:
- Other Information: Portions of this document are illegible in microfiche products
- Country of Publication:
- United States
- Language:
- English
Similar Records
Analysis and implementation of branch-and-bound algorithms on a hypercube multicomputer
Image template matching on MIMD hypercube multicomputers