Accession Number:

ADA232830

Title:

Multiphase Complete Exchange on a Circuit Switched Hypercube

Descriptive Note:

Contractor rept.

Corporate Author:

INSTITUTE FOR COMPUTER APPLICATIONS IN SCIENCE AND ENGINEERING HAMPTON VA

Personal Author(s):

Report Date:

1991-01-01

Pagination or Media Count:

24.0

Abstract:

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.

Subject Categories:

  • Electrical and Electronic Equipment
  • Computer Systems

Distribution Statement:

APPROVED FOR PUBLIC RELEASE