论文信息 - Broadcast communication delay metric for the iPSC/2 and iPSC/860 hypercubes

Broadcast communication delay metric for the iPSC/2 and iPSC/860 hypercubes

When determining the granularity of a program to be executed in parallel, it is important to have valid information on the cost of communication for the system on which the program is to be run. Previous studies have measured the node-to-node communication performance on the Intel Hypercube systems. This work measures the performance of multicast communication on the Intel iPSC/2 and iPSC/860 hypercubes and derives equations modelling the cost of broadcast communication.

[1] P. Pierce,et al. The NX/2 operating system , 1988, C3P.

[2] Carolyn McCreary,et al. Efficient Exploitation of Concurrency Using Graph Decomposition , 1990, ICPP.

[3] Jorge L. C. Sanz,et al. A Simple Mechanism for Efficient Barrier Synchronization in MIMD Machines , 1990, ICPP.

[4] Janak H. Patel,et al. The LAST Algorithm: A Heuristic-Based Static Task Allocation Algorithm , 1989, International Conference on Parallel Processing.

[5] Geoffrey C. Fox,et al. A comparison of the performance of the Caltech Mark 2 hypercube and the Elxsi 6400 , 1986 .

[6] Krishnan Padmanabhan. Cube structures for multiprocessors , 1990, CACM.

[7] Dirk Grunwald,et al. Benchmarking hypercube hardware and software , 1986 .

[8] S. F. Nugent,et al. The iPSC/2 direct-connect communications technology , 1988, C3P.

[9] W. Mendenhall,et al. A second course in business statistics: Regression analysis , 1981 .