A dynamic locality optimization algorithm for linear algebra codes

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

Compiler-directed optimization techniques are effectiv e in reducing the number of cycles spent in off-c hip memory accesses. Recently, methods have been developed that transform memory layouts of data structures at compile-time to improve spatial locality of nested loops beyond current con trol-cen trie (loop nest-based) optimizations. Most of these data-cen trictransformations use a single static (program-wide) memory layout for each array. A disadv antageof these static layout-based localiy. enhancement strategies is that they might fail to optimize codes that manipulate arrays whic hdemand different layouts (from a data locality perspectiv e) in differed parts of the code. In this paper, we presen t a new approafc which extends current static lay out optimization techniques to select dynamically changing memory layouts to further improve the locality of data accesses. We show that the possibilit y of dynamically changing memory layouts during the course of execution adds a new dimension to the data locality optimization problem. Our strategy employs a static layout optimizer module as a building block and by repeatedly invoking it for different parts of the code, it checks whether runtime layout modifications bring additional benefits beyond static optimizer.

Original languageEnglish (US)
Title of host publicationProceedings of the 2001 ACM Symposium on Applied Computing, SAC 2001
PublisherAssociation for Computing Machinery
Pages632-635
Number of pages4
ISBN (Print)1581132875, 9781581132878
DOIs
StatePublished - Mar 1 2001
Event2001 ACM Symposium on Applied Computing, SAC 2001 - Las Vegas, United States
Duration: Mar 11 2001Mar 14 2001

Publication series

NameProceedings of the ACM Symposium on Applied Computing

Other

Other2001 ACM Symposium on Applied Computing, SAC 2001
CountryUnited States
CityLas Vegas
Period3/11/013/14/01

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint Dive into the research topics of 'A dynamic locality optimization algorithm for linear algebra codes'. Together they form a unique fingerprint.

  • Cite this

    Kandemir, M. (2001). A dynamic locality optimization algorithm for linear algebra codes. In Proceedings of the 2001 ACM Symposium on Applied Computing, SAC 2001 (pp. 632-635). (Proceedings of the ACM Symposium on Applied Computing). Association for Computing Machinery. https://doi.org/10.1145/372202.372788