Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Storage Size Reduction by In-place Mapping of Arrays

Remko TronçonContact Information, Maurice BruynoogheContact Information, Gerda JanssensContact Information and Francky CatthoorContact Information

(5)  Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, B-3001 Heverlee, Belgium
(6)  IMEC/DESICS, Kapeldreef 75, B-3001 Heverlee, Belgium
Abstract
Programs for embedded multimedia applications typically manipulate several large multi-dimensional arrays. The energy consumption per access increases with their size; the access to these large arrays is responsible for a substantial part of the power consumption. In this paper, an analysis is developed to compute a bounding box for the elements in the array that are simultaneously in use. The size of the original array can be reduced to the size of the bounding box and accesses to it can be redirected using modulo operations on the original indices. This substantially reduces the size of the memories and the power consumption of accessing them.

Contact Information Remko Tronçon
Email: remko@cs.kuleuven.ac.be

Contact Information Maurice Bruynooghe
Email: maurice@cs.kuleuven.ac.be

Contact Information Gerda Janssens
Email: gerda@cs.kuleuven.ac.be

Contact Information Francky Catthoor
Email: catthoor@imec.be
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.106 • Server: MPWEB26
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)