ACM Home Page
Please provide us with feedback. Feedback
A compiler algorithm for optimizing locality in loop nests
Full text PdfPdf (1.08 MB)
Source International Conference on Supercomputing archive
Proceedings of the 11th international conference on Supercomputing table of contents
Vienna, Austria
Pages: 269 - 276  
Year of Publication: 1997
ISBN:0-89791-902-5
Authors
M. Kandemir  EECS Dept., Syracuse University, Syracuse, NY
J. Ramanujam  ECE Dept., Louisiana State University, Baton Rouge, LA
A. Choudhary  ECE Dept., Northwestern University, Evanston, IL
Sponsor
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 16,   Citation Count: 18
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/263580.263650
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
D. Bailey, T. Harris, W. Saphir, R. van der Winjngaart, A. Woo, and M. Yarrow. The NAS Parallel Benchmarka 2.0., Technical Report NAS-95-020, NASA Ames Reaeaxh Center, CA, December 1995.
3
4
 
5
 
6
7
 
8
M. Kandemir, J. Ftamanujam, and A. Choudhary. A Compiler Algorithm for Optimizing Locality in Loop Nests. Technical Report, Northweetem University, EYBnBton, IL, April 1997.
9
 
10
11
 
12
 
13
14
 
15

CITED BY  18

Collaborative Colleagues:
M. Kandemir: colleagues
J. Ramanujam: colleagues
A. Choudhary: colleagues