Optimal data allocation for Scratch-Pad Memory on embedded multi-core systems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

99 Scopus citations

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.

Original languageEnglish
Title of host publicationProceedings - 2011 International Conference on Parallel Processing, ICPP 2011
Pages464-471
Number of pages8
DOIs
StatePublished - 2011
Externally publishedYes
Event40th International Conference on Parallel Processing, ICPP 2011 - Taipei City, Taiwan, Province of China
Duration: 13 Sep 201116 Sep 2011

Publication series

NameProceedings of the International Conference on Parallel Processing
ISSN (Print)0190-3918

Conference

Conference40th International Conference on Parallel Processing, ICPP 2011
Country/TerritoryTaiwan, Province of China
CityTaipei City
Period13/09/1116/09/11

Fingerprint

Dive into the research topics of 'Optimal data allocation for Scratch-Pad Memory on embedded multi-core systems'. Together they form a unique fingerprint.

Cite this