A technique for overlapping computation and communication for block recursive algorithms
This paper presents a design methodology for developing efficient distributed‐memory parallel programs for block recursive algorithms such as the fast Fourier transform (FFT) and bitonic sort. This design methodology is specifically suited for most modern supercomputers having a distributed‐memory a...
Saved in:
| Published in: | Concurrency (Chichester, England.) Vol. 10; no. 2; pp. 73 - 90 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Chichester
John Wiley & Sons, Ltd
01.02.1998
|
| ISSN: | 1040-3108, 1096-9128 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper presents a design methodology for developing efficient distributed‐memory parallel programs for block recursive algorithms such as the fast Fourier transform (FFT) and bitonic sort. This design methodology is specifically suited for most modern supercomputers having a distributed‐memory architecture with a circuit‐switched or wormhole routed mesh or a hypercube interconnection network. A mathematical framework based on the tensor product and other matrix operations is used for representing algorithms. Communication‐efficient implementations with effectively overlapped computation and communication are achieved by manipulating the mathematical representation using the tensor product algebra. Performance results for FFT programs on the Intel Paragon are presented. © 1998 John Wiley & Sons, Ltd. |
|---|---|
| Bibliography: | ArticleID:CPE289 DARPA - No. 60NANB1D1151; No. 60NANB1D1150 istex:74A1774F73033FF7E93F5C62DCA9342DC9B20F57 ark:/67375/WNG-PCPQ8PRJ-9 |
| ISSN: | 1040-3108 1096-9128 |
| DOI: | 10.1002/(SICI)1096-9128(199802)10:2<73::AID-CPE289>3.0.CO;2-N |