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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing Ročník 2; s. 142 - 149 vol.2
Hlavní autoři: Zhiyong Li, Reif, J.H., Gupta, K.S.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1996
Témata:
Communication networks
Computational fluid dynamics
Computer applications
Computer science
Concurrent computing
Contracts
Dynamic programming
Fast Fourier transforms
Hardware
Tensile stress
ISBN:9780818676239, 081867623X
ISSN:0190-3918
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
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