The fast hartley transform on the hypercube multiprocessors
Book
·
OSTI ID:6933003
The Fast Hartley Transform is a promising alternative to the Fast Fourier Transform when the processed data are real numbers. The hypercube implementation of the FHT is largely dependent on the way the computation is partitioned. A partitioning algorithm is presented which generates evenly-loaded tasks on each node and demands only a regular communication topology - the Hartley graph. Mapping from the Hartley graph to the Graph graph (binary n-cube) is straightforward, since the Hartley graph as a similar structure as the Gray graph. However, the communication is not always between the nearest neighbors and thus may take some extra time. Moreover, the slowness of the communication in the presently available architectures imposes a limitation on the speedup when a large number of processors are used.
- OSTI ID:
- 6933003
- Country of Publication:
- United States
- Language:
- English
Similar Records
Computing the Fourier transform of real data on a hypercube
Parallel-sorting algorithms for hypercube multiprocessors
Multigrid algorithms on the hypercube multiprocessor
Journal Article
·
Fri Nov 30 23:00:00 EST 1990
· Journal of Scientific Computing; (United States)
·
OSTI ID:5386577
Parallel-sorting algorithms for hypercube multiprocessors
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:6155985
Multigrid algorithms on the hypercube multiprocessor
Journal Article
·
Fri Oct 31 23:00:00 EST 1986
· IEEE Trans. Comput.; (United States)
·
OSTI ID:7152157