Optimal data allocation algorithm for loop-centric applications on scratch-pad memories

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

1 Scopus citations

Abstract

The traditional way of managing SPM with arrays is fetching data tiles that are required for the current computation from the off-chip memory. Yet, this method is not the best solution for the array intensive applications. In this paper, we propose a dynamic programming algorithm that can optimally minimize the data transferring cost and the memory access cost for a regular loop. According to the experimental results, the DLAA algorithm can reduce time and energy of the total memory access cost for loops by an average 35-40% compared with the traditional data tiling algorithms.

Original languageEnglish
Title of host publication2013 IEEE Workshop on Signal Processing Systems, SiPS 2013
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages383-388
Number of pages6
ISBN (Print)9781467362382
DOIs
StatePublished - 2013
Externally publishedYes
Event2013 IEEE Workshop on Signal Processing Systems, SiPS 2013 - Taipei, Taiwan, Province of China
Duration: 16 Oct 201318 Oct 2013

Publication series

NameIEEE Workshop on Signal Processing Systems, SiPS: Design and Implementation
ISSN (Print)1520-6130

Conference

Conference2013 IEEE Workshop on Signal Processing Systems, SiPS 2013
Country/TerritoryTaiwan, Province of China
CityTaipei
Period16/10/1318/10/13

Keywords

  • Data placement
  • Embedded system
  • SPM

Fingerprint

Dive into the research topics of 'Optimal data allocation algorithm for loop-centric applications on scratch-pad memories'. Together they form a unique fingerprint.

Cite this