ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Efficient procedure mapping using cache line coloring
Full text PdfPdf (1.70 MB)
Source ACM SIGPLAN Notices archive
Volume 32 ,  Issue 5  (May 1997) table of contents
Pages: 171 - 182  
Year of Publication: 1997
ISSN:0362-1340
Also published in ...
Authors
Amir H. Hashemi  Dept. of Electrical and Computer Engineering, Northeastern University, Boston, MA
David R. Kaeli  Dept. of Electrical and Computer Engineering, Northeastern University, Boston, MA
Brad Calder  Dept. of Computer Science and Engineering, University of California, San Diego, La Jolla, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 38,   Citation Count: 25
Additional Information:

abstract   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/258916.258931
What is a DOI?

ABSTRACT

As the gap between memory and processor performance continues to widen, it becomes increasingly important to exploit cache memory eflectively. Both hardware and aoftware approaches can be explored to optimize cache performance. Hardware designers focus on cache organization issues, including replacement policy, associativity, line size and the resulting cache access time. Software writers use various optimization techniques, including software prefetching, data scheduling and code reordering. Our focus is on improving memory usage through code reordering compiler techniques.In this paper we present a link-time procedure mapping algorithm which can significantly improve the eflectiveness of the instruction cache. Our algorithm produces an improved program layout by performing a color mapping of procedures to cache lines, taking into consideration the procedure size, cache size, cache line size, and call graph. We use cache line coloring to guide the procedure mapping, indicating which cache lines to avoid when placing a procedure in the program layout. Our algorithm reduces on average the instruction cache miss rate by 40% over the original mapping and by 17% over the mapping algorithm of Pettis and Hansen [12].


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
L. Belady. A study of replacement algorithms for a virtualstorage computer. IBM Systems Journal, 5(2):78-101, 1966.
3
4
 
5
 
6
B. Calder, D. Grunwald, and B. Zorn. Quantifying behavioral differences between C and G++ programs. Journal of Programming Languages, 2(4), 1994.
7
8
9
 
10
11
12
 
13
 
14
15
 
16
 
17
A. Sampoga. Architectural Implications of C and C-t-4- Programming Models. MS Thesis, Northeastern University, August 1995.
18
 
19
 
20
21
22

CITED BY  25

Collaborative Colleagues:
Amir H. Hashemi: colleagues
David R. Kaeli: colleagues
Brad Calder: colleagues