Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/7118
Title: Access Normalization: Loop Restructuring for NUMA Compilers
Authors: Li, Wei
Pingali, Keshav
Keywords: computer science
technical report
Issue Date: Apr-1992
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR92-1278
Abstract: A common feature of many scalable parallel machines is non-uniform memory access - a processor can access data in its local memory ten to a thousand times faster than it can access non-local data. In addition, when a number of remote accesses must be made, it is usually more efficient to use block transfers of data rather than to use many small messages. To run well on such machines, software must exploit these features. We believe it is too onerous for a programmer to do this by hand, so we have been exploring the use of restructuring compiler technology for this purpose. In this paper, we start with a language like FORTRAN-D with user-specified data distributions and develop a systematic loop transformation strategy called access normalization that restructures loop nests to exploit both locality and block transfers wherever possible. We demonstrate the power of our techniques using routines from the BLAS (Basic Linear Algebra Subprograms) library. Our loop transformation strategy is expressed in the framework of invertible matrices and integer lattice theory and it is an important generalization of Banerjee's framework of unimodular matrices.
URI: http://hdl.handle.net/1813/7118
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
92-1278.pdf3.1 MBAdobe PDFView/Open
92-1278.ps625 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us