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!
|
Be the first to leave a comment!