Power estimation approach of dynamic data storage on a hardware software boundary level

5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In current multimedia applications like 3D graphical processing or games, the run-time memory management support has to allow real-time memory de/allocation, retrieving and data processing. The implementations of these algorithms for embedded platforms require high speed, low power and large data storage capacity. Due to the large hardware/software co-design space, high-level implementation cost estimates are required to avoid expensive design modifications late in the implementation. In this paper, we present an approach designed to do that. Based on memory accesses, normalised memory usage1 and power estimates, the algorithm code is refined. Furthermore, optimal implementations for the dynamic data types involved can be selected with a considerable power contribution reduction. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Leeman, M., Atienza, D., Catthoor, F., De Florio, V., Deconinck, G., Mendias, J. M., & Lauwereins, R. (2003). Power estimation approach of dynamic data storage on a hardware software boundary level. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2799, 289–298. https://doi.org/10.1007/978-3-540-39762-5_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free