Optimal Data Allocation for Scratch-Pad Memory on Embedded Multi-core Systems

Authors:
Yibo Guo;Qingfeng Zhuge;Jingtong Hu;Meikang Qiu;Edwin H. -M. Sha
Affiliations:
-;-;-;-;-
Venue:
ICPP '11 Proceedings of the 2011 International Conference on Parallel Processing
Year:
2011

Citing 0
Cited 2

Partitioned scheduling for real-time tasks on multiprocessor embedded systems with programmable shared srams

Proceedings of the tenth ACM international conference on Embedded software
Management and optimization for nonvolatile memory-based hybrid scratchpad memory on multicore embedded processors

ACM Transactions on Embedded Computing Systems (TECS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.