DMCA
Heap Data Allocation To Scratch-Pad Memory In Embedded Systems (2007)
Cached
Download Links
| Citations: | 43 - 5 self |
BibTeX
@MISC{Dominguez07heapdata,
author = {Angel Dominguez},
title = { Heap Data Allocation To Scratch-Pad Memory In Embedded Systems},
year = {2007}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This thesis presents the first-ever compile-time method for allocating a portion of a program’s dynamic data to scratch-pad memory. A scratch-pad is a fast directly addressed compiler-managed SRAM memory that replaces the hardware-managed cache. It is motivated by its better real-time guarantees vs cache and by its signifi-cantly lower overheads in access time, energy consumption, area and overall runtime. Dynamic data refers to all objects allocated at run-time in a program, as opposed to static data objects which are allocated at compile-time. Existing compiler methods for allocating data to scratch-pad are able to place only code, global and stack data (static data) in scratch-pad memory; heap and recursive-function objects(dynamic data) are allocated entirely in DRAM, resulting in poor performance for these dy-namic data types. Runtime methods based on software caching can place data in scratch-pad, but because of their high overheads from software address translation, they have not been successful, especially for dynamic data. In this thesis we present a dynamic yet compiler-directed allocation method for dynamic data that for the first time, (i) is able to place a portion of the dynamic
Keyphrases
scratch-pad memory dynamic data heap data allocation embedded system abstract title energy consumption hardware-managed cache static data compiler-managed sram memory compiler method dy-namic data type dynamic data refers static data object stack data first time runtime method recursive-function object overall runtime first-ever compile-time method high overhead program dynamic data access time poor performance software address translation compiler-directed allocation method real-time guarantee
