Cache models for iterative compilation

DOI10.1007/3-540-44681-8_37MaRDI QIDQ4791901zbMATH OpenFDO

Authors T. Kisuki, K. A. Gallivan, Peter M. W. Knijnenburg

Publication date 4 February 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2150/21500254

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 2079655
• Combined selection of tile sizes and unroll factors using iterative compilation
• A methodology pruning the search space of six compiler transformations by addressing them together as one problem and by exploiting the hardware architecture details
• UMDA/S: an effective iterative compilation algorithm for parameter search
• Languages and Compilers for Parallel Computing

Cited in

(3)

• Code isolation based iterative compilation optimization for large programs
• UMDA/S: an effective iterative compilation algorithm for parameter search
• scientific article; zbMATH DE number 2079655 (Why is no real title available?)

This page was built for publication: Cache models for iterative compilation

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