ACM Home Page
Please provide us with feedback. Feedback
Exploiting scratch-pad memory using Presburger formulas
Full text PdfPdf (276 KB)
Source International Symposium on Systems Synthesis archive
Proceedings of the 14th international symposium on Systems synthesis table of contents
Montréal, P.Q., Canada
Session: Memory optimization methodologies table of contents
Pages: 7 - 12  
Year of Publication: 2001
ISBN:1-58113-418-5
Authors
Mahmut Kandemir  Pennsylvania State University, University Park, PA
Ismail Kadayif  Pennsylvania State University, University Park, PA
Ugur Sezer  University of Wisconsin, Madison, WI
Sponsors
IEEE : IEEE Computer Society Technical Committee on Design Automation
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 14,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Effective utilization of on-chip storage space is important from both performance (execution cycles)and memory system energy consumptions perspectives. While on-chip cache memories have been widely used in the past, several factors, including lack of data access time predictability and limited effectiveness of compiler optimizations, indicate that they may not be the best candidate for portable/embedded devices. This paper presents a compiler-directed on-chip scratch-pad memory (software-managed on-chip memory) management strategy for data accesses. Our strategy is oriented towards minimizing the number of data transfers between off-chip memory and the scratch-pad memory, thereby exploiting reuse for the data residing in the scratch-pad memory. We report experimental data from our implementation showing the usefulness of our technique.


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
S. P. Amarasinghe, J. M. Anderson, M. S. Lam, and C. W. Tseng. The SUIF compiler for scalable parallel machines. In Proc. the Seventh SIAM Conference on Parallel Processing for Scientific Computing, February, 1995.
 
2
 
3
4
 
5
6
 
7
 
8
S. Wilton and N. P. Jouppi. CACTI: an enhanced cycle access and cycle time model. IEEE Journal of Solid-State Circuits, pp. 677-687, 1996.

CITED BY  7

Collaborative Colleagues:
Mahmut Kandemir: colleagues
Ismail Kadayif: colleagues
Ugur Sezer: colleagues