Please use this identifier to cite or link to this item:
|Title:||WCET centric data allocation to scratchpad memory|
|Authors:||Suhendra, V. |
|Citation:||Suhendra, V.,Mitra, T.,Roychoudhury, A.,Chen, T. (2005). WCET centric data allocation to scratchpad memory. Proceedings - Real-Time Systems Symposium : -. ScholarBank@NUS Repository. https://doi.org/10.1109/RTSS.2005.45|
|Abstract:||Scratchpad memory is a popular choice for on-chip storage in real-time embedded systems. The allocation of code/data to scratchpad memory is performed at compile time leading to predictable memory access latencies. Current scratchpad memory allocation techniques improve the average-case execution time of tasks. For hard real-time systems, on the other hand, worst case execution time (WCET) is a key metric. In this paper, we propose scratchpad allocation techniques for data memory that aim to minimize a task's WCET. We first develop an integer linear programming (ILP) based solution which constructs the optimal allocation assuming that all program paths are feasible. Next, we employ branch-and-bound search to more accurately construct the optimal allocation by exploiting infeasible path information. However, the branch-and-bound search is too time-consuming in practice. Therefore, we design fast heuristic searches that achieve near-optimal allocations for all our benchmarks. © 2005 IEEE.|
|Source Title:||Proceedings - Real-Time Systems Symposium|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 17, 2018
checked on Dec 15, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.