Work

A compiler algorithm for optimizing locality in loop nests

Year: 1997

Type: conference-paper

Abstract: This paper describes an algorithm to optimize cache locality in scientic codes on uniprocessor and multiprocessor ma-chines. A distinctive characteristic of our algorithm is that it considers loop and data layout transformations in a uni-ed framework. We illustrate through examples that our approach is very eective at reducing cache misses and tile-size sensitivity of blocked loop nests; and can optimize nests for which optimization techniques based on loop transfor-mations alone are not successful. An important special case is the one in which data layouts of some arrays are xed and cannot be changed. We show how our algorithm can handle this case, and demonstrate how it can be used to optimize multiple loop nests. 1

Source: International Conference on Supercomputing

DOI: 10.1145/263580.263650

Authors: M. Kandemir, J. Ramanujam, A. Choudhary

Institutions: Syracuse University, Louisiana State University, Northwestern University

Language: English

Topic: Parallel Computing and Optimization Techniques

Subfield: Hardware and Architecture

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2045773292

FWCI: 5.065

Cites: 18

Cited by: 55

Related to: 10