Paper Details
Reference:
D. Kulkarni and Michael Stumm,
Linear and extended linear transformations for shared-memory multiprocessors",
The Computer Journal, 40(6), June, 1997, pp. 373–387.
Download:
Abstract:
Advances in program transformation frameworks have signi"cantly advanced compiler technology over the past few years. Program transformation frameworks provide mathematical abstractions of loop and data structures and formal methods for manipulating these structures. It is these frameworks that have allowed the development of algorithms capable of automatically tailoring an application for a target architecture. In this paper, we focus on the utility of these frameworks in improving the performance of mainly parallel applications on shared-memory multiprocessors. Data locality-oriented program optimizations are a key to good performance on shared-memory multiprocessors, since these optimizations can often improve performance by a factor of 10 or more.
In this paper, we show the effectiveness of three key loop and data transformation frameworks in optimizing parallel programs on shared-memory multiprocessors. In particular, we describe our computation decomposition and alignment (CDA) framework, which can modify both the composition and the execution order of the re-composed iterations. We show how fine-grain transformations within the CDA framework enable new optimizations such as local optimizations that are otherwise achieved by global data transformations.
Keywords:
Compiler techniques, shared memory multiprocessors, loop transformation, data transformation
Reference Info:
DOI: 10.1093/comjnl/40.6.373
OCLC: 106760753
BibTeX:
@article(Kulkarni-CompuJ97, author = {D. Kulkarni and Michael Stumm}, title = {Linear and extended linear transformations for shared-memory multiprocessors}, volume = {40}, number = {6}, month = {June}, year = {1997}, pages = {373-387}, doi = {10.1093/comjnl/40.6.373}, keywords = {Compiler techniques, shared memory multiprocessors, loop transformation, data transformation} )