ACM Home Page
Please provide us with feedback. Feedback
A dynamic locality optimization algorithm for linear algebra codes
Full text PdfPdf (108 KB)
Source Symposium on Applied Computing archive
Proceedings of the 2001 ACM symposium on Applied computing table of contents
Las Vegas, Nevada, United States
Pages: 632 - 635  
Year of Publication: 2001
ISBN:1-58113-287-5
Author
Mahmut Kandemir  Microsystems Design Laboratory, Pennsylvania State University, University Park, PA
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 13,   Citation Count: 1
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/372202.372788
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
U. Banerjee. Unimodular transformations of double loops. In Advances in Languages and Compilers for Parallel Processing, edited by A. Nicolau et al., MIT Press, 1991.
3
4
 
5
6
7
 
8
S.-T. Leung and J. Zahorjan. Optimizing data locality by array restructuring. Technical Report TR 95-09-01, Department of Computer Science and Engineering, University ofWashington, Sept. 1995.
 
9
10
 
11
M. O'Boyle and P. Knijnenburg. Non-singular data transformations: Definition, validity, applications. In Proc. 6th Workshop on Compilers for Parallel Computers, pages 287-297, Aachen, Germany, 1996.
12
 
13