ACM Home Page
Please provide us with feedback. Feedback
SPM management using Markov chain based data access prediction
Full text PdfPdf (191 KB)
Source
International Conference on Computer Aided Design archive
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design table of contents
San Jose, California
SESSION: Advances in embedded systems table of contents
Pages 565-569  
Year of Publication: 2008
ISBN ~ ISSN:1092-3152 , 978-1-4244-2820-5
Authors
Taylan Yemliha  Syracuse University, Syracuse, NY
Shekhar Srikantaiah  Pennsylvania State University, University Park, PA
Mahmut Kandemir  Pennsylvania State University, University Park, PA
Ozcan Ozturk  Bilkent University, Ankara, Turkey
Sponsors
: IEEE CASS/CANDE
: IEEE Council on Electronic Design Automation (CEDA)
SIGDA: ACM Special Interest Group on Design Automation
Publisher
IEEE Press  Piscataway, NJ, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 49,   Citation Count: 0
Additional Information:

abstract   references   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

Leveraging the power of scratchpad memories (SPMs) available in most embedded systems today is crucial to extract maximum performance from application programs. While regular accesses like scalar values and array expressions with affine subscript functions have been tractable for compiler analysis (to be prefetched into SPM), irregular accesses like pointer accesses and indexed array accesses have not been easily amenable for compiler analysis. This paper presents an SPM management technique using Markov chain based data access prediction for such irregular accesses. Our approach takes advantage of inherent, but hidden reuse in data accesses made by irregular references. We have implemented our proposed approach using an optimizing compiler. In this paper, we also present a thorough comparison of our different dynamic prediction schemes with other SPM management schemes. SPM management using our approaches produces 12.7% to 28.5% improvements in performance across a range of applications with both regular and irregular access patterns, with an average improvement of 20.8%.


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
3
 
4
5
6
 
7
8
9
10
 
11
 
12
 
13
 
14
N. Nguyenet al. "Memory allocation for embedded systems with a compile-time-unknown scratch-pad size," in CASES, 2005.
 
15
 
16
17
18
19
 
20
V. Srinivasan et al. "A static filter for reducing prefetch traffic," in CSE-TR-400-99, UMich, 1999.
 
21
 
22
Collaborative Colleagues:
Taylan Yemliha: colleagues
Shekhar Srikantaiah: colleagues
Mahmut Kandemir: colleagues
Ozcan Ozturk: colleagues