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

Author

Guo, Yibo ; Zhuge, Qingfeng ; Hu, Jingtong ; Qiu, Meikang ; Sha, Edwin H -M

Author_Institution

Dept. of Comput. Sci., Univ. of Texas at Dallas, Richardson, TX, USA

fYear

2011

fDate

13-16 Sept. 2011

Firstpage

464

Lastpage

471

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.

Keywords

circuit complexity; embedded systems; memory architecture; microprocessor chips; multiprocessing systems; data copy; embedded multicore system; energy cost; greedy algorithm; high-performance embedded system; optimal data allocation; polynomial-time algorithm; scratch pad memory; software-controlled on-chip memory; Dynamic programming; Dynamic scheduling; Heuristic algorithms; Integrated circuits; Multicore processing; Resource management; Data Allocation; Multi-core; SPM;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Processing (ICPP), 2011 International Conference on

Conference_Location

Taipei City

ISSN

0190-3918

Print_ISBN

978-1-4577-1336-1

Electronic_ISBN

0190-3918

Type

conf

DOI

10.1109/ICPP.2011.79

Filename

6047214