DocumentCode :
2547644
Title :
Data Allocation for SPM Based on Knapsack Problem
Author :
Yao Yingbiao ; Wang Bin ; Chen Huahua ; Zhang Jianwu
Author_Institution :
Coll. of Telecommun. Eng., Hangzhou Dianzi Univ., Hangzhou
Volume :
2
fYear :
2009
fDate :
22-24 Jan. 2009
Firstpage :
234
Lastpage :
237
Abstract :
Data allocation of on-chip scratch-pad memory is a key problem for the performance of embedded system employing SPM as on-chip data memory. Based on the solution to knapsack problem, we propose its knapsack model then employ dynamic planning method to give its optimal algorithm with the complexity of O(nC). Experiment results show that the method proposed in this paper can obtain the optimal result during static or dynamic data allocation of SPM.
Keywords :
computational complexity; data handling; embedded systems; knapsack problems; storage management; data allocation; embedded system; knapsack problem; on-chip data memory; on-chip scratch-pad memory; Data engineering; Embedded computing; Embedded system; Greedy algorithms; Optimization methods; Phased arrays; Real time systems; Scanning probe microscopy; System-on-a-chip; Telecommunication computing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Engineering and Technology, 2009. ICCET '09. International Conference on
Conference_Location :
Singapore
Print_ISBN :
978-1-4244-3334-6
Type :
conf
DOI :
10.1109/ICCET.2009.50
Filename :
4769595
Link To Document :
بازگشت