Experiences with the Intel Hypercube

Authors:
William J. Ouchark;Jay A. Davis;S. Lakshmivarahan;Sudarshan K. Dhall
Affiliations:
-;-;-;-
Venue:
SAC '86 Proceedings of the 1986 workshop on Applied computing
Year:
1986

Citing 0
Cited 1

Robust network connectivity: when it's the big picture that matters

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a comparative analysis of the performance of two different parallel algorithms for solving the prefix problem on the Intel Hypercube. Estimates of the key parameters that determine the cost of communication between nodes are also given. It turns out that the ratio of communication cost to that of unit computation is quite high (is in the range of 240 to 470) for this class of machines.