Synthesizing efficient out-of-core programs for block recursive algorithms using block-cyclic data distributions
This paper presents a framework for synthesizing I/O-efficient out-of-core programs for block recursive algorithms, such as the fast Fourier transform and matrix transpositions. the programs are synthesized from tensor (Kronecker) product representations of algorithms. These programs are optimized f...
Uložené v:
| Vydané v: | Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing Ročník 2; s. 142 - 149 vol.2 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
1996
|
| Predmet: | |
| ISBN: | 9780818676239, 081867623X |
| ISSN: | 0190-3918 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | This paper presents a framework for synthesizing I/O-efficient out-of-core programs for block recursive algorithms, such as the fast Fourier transform and matrix transpositions. the programs are synthesized from tensor (Kronecker) product representations of algorithms. These programs are optimized for a striped two-level memory model where in the out-of-core data can have block-cyclic distributions on multiple disks. |
|---|---|
| ISBN: | 9780818676239 081867623X |
| ISSN: | 0190-3918 |
| DOI: | 10.1109/ICPP.1996.537393 |

