Data dependency size estimation for use in memory optimization (2003)
| Venue: | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems |
| Citations: | 19 - 5 self |
BibTeX
@ARTICLE{Kjeldsberg03datadependency,
author = {Per Gunnar Kjeldsberg and Francky Catthoor and Einar J. Aas},
title = {Data dependency size estimation for use in memory optimization},
journal = {IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
year = {2003},
volume = {22},
pages = {908--921}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract — A novel storage requirement estimation methodology is presented for use in the early system design phases when the data transfer ordering is only partly fixed. At that stage, none of the existing estimation tools are adequate, as they either assume a fully specified execution order or ignore it completely. This paper presents an algorithm for automated estimation of strict upper and lower bounds on the individual data dependency sizes in high level application code given a partially fixed execution ordering. In the overall estimation technique, this is followed by a detection of the maximally combined size of simultaneously alive dependencies, resulting in the overall storage requirement of the application. Using representative application demonstrators, we show how our techniques can effectively guide the designer to achieve a transformed specification with low storage requirement.
