Loop transformations for reducing data space requirements of resource-constrained applications

DOI10.1007/3-540-44898-5_22MaRDI QIDQ4813410zbMATH OpenFDO

Authors P. Unnikrishnan, Guangyu Chen, Mustafa Karakoy, Ibrahim Kolcu, Mahmut Taylan Kandemir

Publication date 13 August 2004

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/2694/26940383.htm

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• A polynomial-time algorithm for memory space reduction
• scientific article; zbMATH DE number 1746886
• Precise data locality optimization of nested loops
• Influence of loop optimizations on energy consumption of multi-bank memory systems
• Euro-Par 2004 Parallel Processing

Cited in

(4)

• A polynomial-time algorithm for memory space reduction
• A Lightweight Approach for Loop Summarization
• scientific article; zbMATH DE number 1746886 (Why is no real title available?)
• Storage size reduction by in-place mapping of arrays

This page was built for publication: Loop transformations for reducing data space requirements of resource-constrained applications

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