This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2011 International Conference on Parallel Processing
Optimal Data Allocation for Scratch-Pad Memory on Embedded Multi-core Systems
Taipei City, Taiwan
September 13-September 16
ISBN: 978-0-7695-4510-3
Multi-core systems have been a popular design for high-performance embedded systems. Scratch Pad Memory (SPM), a software-controlled on-chip memory, has been widely adopted in many embedded systems due to its small area and low energy consumption. Existing data allocation algorithms either cannot achieve optimal results or take exponential time to complete. In this paper, we propose one polynomial-time algorithms to solve the data allocation problem on multi-core system with exclusive data copy. According to the experimental results, the proposed optimal data allocation method alone reduces time cost of memory accesses by 16.45\% on average compared with greedy algorithm. The proposed data allocation algorithm also can reduce the energy cost significantly.
Index Terms:
SPM, Data Allocation, Multi-core
Citation:
Yibo Guo, Qingfeng Zhuge, Jingtong Hu, Meikang Qiu, Edwin H.-M. Sha, "Optimal Data Allocation for Scratch-Pad Memory on Embedded Multi-core Systems," icpp, pp.464-471, 2011 International Conference on Parallel Processing, 2011
Usage of this product signifies your acceptance of the Terms of Use.