A quantitative analysis of tile size selection algorithms

DOI10.1023/B:SUPE.0000011388.54204.8EMaRDI QIDQ1426947zbMATH OpenOpenAlexFDO

Authors Chung-hsing Hsu, Ulrich Kremer

Publication date 15 March 2004

Published in The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:supe.0000011388.54204.8e

zbMATH Keywords

loop tilingcompiler optimizationsperformance modelsarray paddingmemory hierarchy optimizationquantitative case study

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Theory of compilers and interpreters (68N20)

Recommendations

• Combined selection of tile sizes and unroll factors using iterative compilation
• scientific article; zbMATH DE number 1520614
• Static tiling for heterogeneous computing platforms.
• Time-minimal and processor-time-minimal loop tiling

Cited in

(6)

• Combined selection of tile sizes and unroll factors using iterative compilation
• Method of ranking tiles size parameters of a parallel algorithm
• scientific article; zbMATH DE number 2079655 (Why is no real title available?)
• An I/O-conscious tiling strategy for disk-resident data sets
• scientific article; zbMATH DE number 2087545 (Why is no real title available?)
• scientific article; zbMATH DE number 2087768 (Why is no real title available?)

This page was built for publication: A quantitative analysis of tile size selection algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1426947)