A Framework for Interprocedural Locality Optimization Using Both Loop and Data Layout Transformations

Authors:
Mahmut Kandemir;Alok Choudhary;J. Ramanujam;Prithviraj Banerjee
Affiliations:
-;-;-;-
Venue:
ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing
Year:
1999

Citing 0
Cited 4

A compiler technique for improving whole-program locality

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Interprocedural optimizations for improving data cache performance of array-intensive embedded applications

Proceedings of the 40th annual Design Automation Conference
Improving whole-program locality using intra-procedural and inter-procedural transformations

Journal of Parallel and Distributed Computing
Partial access conflict-relieving programmable address shuffler for parallel memory system in multi-core processor

Microprocessors & Microsystems

Quantified Score

Hi-index	0.00

Visualization

Abstract

There has been much work recently on improving the locality performance of loop nests in scientific programs through the use of loop as well as data layout optimizations. However, little attention has been paid to the problem of optimizing locality in whole programs, particularly in the presence of procedures. Current techniques do not propagate layout optimizations across procedures boundaries; this is critical for realistic scientific codes, since the cost of explicitly transforming memory layouts across procedure boundaries might be very high. In this paper we present a locality optimization framework that uses both loop and data transformations to improve cache locality program-wide. Our framework propagates layout (or locality) constraints as a system of equalities across procedures and involves two traversals in the call graph representation of the program. Preliminary experimental results obtained on an R10000 based system demonstrate the power of the framework.