Data dependency size estimation for use in memory optimization

Authors:
P. G. Kjeldsberg;F. Catthoor;E. J. Aas
Affiliations:
Norwegian Univ. of Sci. & Technol., Trondheim, Norway;-;-
Venue:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Year:
2006

Citing 0
Cited 16

High-level synthesis using computation-unit integrated memories

Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Hierarchical memory size estimation for loop fusion and loop shifting in data-dominated applications

ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
Memory size computation for multimedia processing applications

ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
Polyhedral space generation and memory estimation from interface and memory models of real-time video systems

Journal of Systems and Software
Fast memory footprint estimation based on maximal dependency vector calculation

Proceedings of the conference on Design, automation and test in Europe
Incremental hierarchical memory size estimation for steering of loop transformations

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Computation of storage requirements for multi-dimensional signal processing applications

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Mapping model with inter-array memory sharing for multidimensional signal processing

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Computation of the minimum data storage and applications in memory management for multimedia signal processing

Integrated Computer-Aided Engineering
Generation of heterogeneous distributed architectures for memory-intensive applications through high-level synthesis

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Storage Estimation and Design Space Exploration Methodologies for the Memory Management of Signal Processing Applications

Journal of Signal Processing Systems
On minimizing register usage of linearly scheduled algorithms with uniform dependencies

Computer Languages, Systems and Structures
Signal Assignment Model for the Memory Management of Multidimensional Signal Processing Applications

Journal of Signal Processing Systems
Experiences with enumeration of integer projections of parametric polytopes

CC'05 Proceedings of the 14th international conference on Compiler Construction
Near-optimal and scalable intrasignal in-place optimization for non-overlapping and irregular access schemes

ACM Transactions on Design Automation of Electronic Systems (TODAES)
A scalable and near-optimal representation of access schemes for memory management

ACM Transactions on Architecture and Code Optimization (TACO)

Quantified Score

Hi-index	0.03

Visualization

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.