Multiphase complete exchange on a circuit switched hypercube. Contractor report
Technical Report
·
OSTI ID:5603243
On a distributed memory parallel computer system, the complete exchange communication pattern requires each of n processors to send a different m byte block of data to each of the remaining n-1 processors. This communication pattern arises in many important applications such as matrix transpose, matrix-vector multiply, 2-dimensional FFTs, distributed table look-ups etc. It is also important in its own right since, being equivalent to a complete directed graph, it is the densest communication requirement that can be imposed on an interconnection network. The time required to carry out the complete exchange is an important measure of the power of a distributed memory parallel computer system. There are two algorithms for complete exchange on circuit switched hypercubes like the Intel iPSC-2, Intel iPSC-860, and Ncube-2. The first is the Standard Exchange algorithm. The second is the Optimal Circuit Switched algorithm.
- Research Organization:
- National Aeronautics and Space Administration, Hampton, VA (USA). Inst. for Computer Applications in Science and Engineering
- OSTI ID:
- 5603243
- Report Number(s):
- AD-A-232830/0/XAB; ICASE--91-5; CNN: NAS1-18605
- Country of Publication:
- United States
- Language:
- English
Similar Records
Performance of the Intel iPSC/860 hypercube
Performance of the Intel iPSC/860 and Ncube 6400 hypercubes
Complete exchange on the IPSC-860. Final report
Technical Report
·
Fri Jun 01 00:00:00 EDT 1990
·
OSTI ID:6745398
Performance of the Intel iPSC/860 and Ncube 6400 hypercubes
Journal Article
·
Tue Jul 12 20:00:00 EDT 2005
· Parallel Computing
·
OSTI ID:5710182
Complete exchange on the IPSC-860. Final report
Technical Report
·
Mon Dec 31 23:00:00 EST 1990
·
OSTI ID:5720262