Data communication in hypercubes

Youcef Saad, Martin H. Schultz

Research output: Contribution to journalArticlepeer-review

85 Scopus citations

Abstract

In this paper we consider several algorithms for exchanging data among processors in a hypercube network. The data transfer problems considered are those arising from classical numerical algorithms such as Gaussian elimination, conjugate gradient methods, and the N-body problem. We propose some estimates for the timings of the various algorithms which reveal that multiprocessors based on the hypercube topology can be very efficient in performing data exchange operations.

Original languageEnglish (US)
Pages (from-to)115-135
Number of pages21
JournalJournal of Parallel and Distributed Computing
Volume6
Issue number1
DOIs
StatePublished - Feb 1989

Bibliographical note

Funding Information:
* This work was supported in part by ONR Grant NO00 14-82-K-O 184 and in part by a joint study with IBM/Kingston.

Fingerprint Dive into the research topics of 'Data communication in hypercubes'. Together they form a unique fingerprint.

Cite this