DocumentCode
3313013
Title
Optimizing Data Allocation for Loops on Embedded Systems with Scratch-Pad Memory
Author
Zhang, Jun ; Deng, Tan ; Gao, Qiuyan ; Zhuge, Qingfeng ; Sha, Edwin H -M
Author_Institution
Coll. of Inf. Sci. & Eng, Hunan Univ., Changsha, China
fYear
2012
fDate
19-22 Aug. 2012
Firstpage
184
Lastpage
191
Abstract
Scratch Pad Memory (SPM), a software-controlled on-chip memory, is popular in embedded systems due to its many benefits. To efficiently manage SPM, many different data allocation algorithms are proposed. However, most of them cannot achieve optimal results. In this paper, we proposed a dynamic programming approach, Iterational Optimal Data Allocation (IODA) to allocate data for embedded systems with multiple types of memory units. According to the experimental results, the IODA algorithm lowered the energy consumption by 20.14% and 5.11% compared to a random memory allocation and a greedy algorithm, respectively. It also reduced the memory access time by 18.44% and 5.83% compared to a random memory allocation and a greedy algorithm, respectively.
Keywords
cache storage; dynamic programming; greedy algorithms; iterative methods; IODA algorithm; SPM; data allocation algorithms; dynamic programming approach; embedded systems; greedy algorithm; iterational optimal data allocation; random memory allocation; scratch-pad memory; software-controlled on-chip memory; Arrays; Dynamic programming; Embedded systems; Heuristic algorithms; Resource management; System-on-a-chip; Data allocation; Loops; Optimization; Scratch-pad memory;
fLanguage
English
Publisher
ieee
Conference_Titel
Embedded and Real-Time Computing Systems and Applications (RTCSA), 2012 IEEE 18th International Conference on
Conference_Location
Seoul
ISSN
1533-2306
Print_ISBN
978-1-4673-3017-6
Electronic_ISBN
1533-2306
Type
conf
DOI
10.1109/RTCSA.2012.20
Filename
6300150
Link To Document