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 language | English |
|---|---|
| Title of host publication | Proceedings - 2011 International Conference on Parallel Processing, ICPP 2011 |
| Pages | 464-471 |
| Number of pages | 8 |
| DOIs | |
| State | Published - 2011 |
| Externally published | Yes |
| Event | 40th International Conference on Parallel Processing, ICPP 2011 - Taipei City, Taiwan, Province of China Duration: 13 Sep 2011 → 16 Sep 2011 |
Publication series
| Name | Proceedings of the International Conference on Parallel Processing |
|---|---|
| ISSN (Print) | 0190-3918 |
Conference
| Conference | 40th International Conference on Parallel Processing, ICPP 2011 |
|---|---|
| Country/Territory | Taiwan, Province of China |
| City | Taipei City |
| Period | 13/09/11 → 16/09/11 |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 7 Affordable and Clean Energy
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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver