SMO: an integrated approach to intra-array and inter-array storage optimization

DOI10.1145/2837614.2837636zbMATH Open1347.68070OpenAlexW2294053719MaRDI QIDQ2828294FDOQ2828294

Authors: Somashekaracharya G. Bhaskaracharya, Uday Bondhugula, Albert Cohen 

Publication date: 24 October 2016

Published in: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01425888/file/paper.pdf

Recommendations

• A polynomial-time algorithm for memory space reduction
• Improving whole-program locality using intra-procedural and inter-procedural transformations
• Array organization in parallel memories
• scientific article; zbMATH DE number 1693499
• scientific article; zbMATH DE number 1863274

zbMATH Keywords

compilersmemory optimizationarray contractionpolyhedral frameworkstorage mapping optimization

Mathematics Subject Classification ID

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

Cited In (1)

• A polynomial-time algorithm for memory space reduction

This page was built for publication: SMO: an integrated approach to intra-array and inter-array storage optimization

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