(Enter summary)
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
... (Update)
Context of citations to this paper: More
...that can be transformed to DSA. A second issue is that array sizes can grow considerably. Advanced methods exist for compacting arrays[5, 17]. When used in combination with loop transformations[4] they can reduce the arrays again often beyond their original size. In Sec. 2...
Cited by: More
Lattice-Based Memory Allocation - Darte, Schreiber, Villard (2004)
(Correct)
Advanced Copy Propagation for Arrays - Vanbroekhoven, Janssens.. (2003)
(Correct)
Active bibliography (related documents): More All
0.7: Resource-Passing Concurrent Programming - Ueda
(Correct)
0.6: Data and Memory Optimization Techniques for Embedded.. - Panda, Catthoor, Dutt, .. (2001)
(Correct)
0.5: How to Solve the Current Memory Access and Data Transfer.. - Catthoor (2000)
(Correct)
Similar documents based on text: More All
0.6: Geometric Model Checking: An Automatic.. - Shashidhar.. (2002)
(Correct)
0.6: An Automatic Verification Technique for Loop and.. - Shashidhar.. (2003)
(Correct)
0.6: A Heuristic for Improving the Regularity of.. - Verdoolaege.. (2001)
(Correct)
Related documents from co-citation: More All
2: Optimizing memory usage in the polyhedral model (context) - Quillere, Rajopadhye - 1998
2: Memory size reduction through storage order optimization for embedded parallel m..
- De Greef, Catthoor et al. - 1997
2: Geometry of numbers (context) - Gruber, Lekkerkerker - 1987
BibTeX entry: (Update)
R. Troncon, M. Bruynooghe, G. Janssens, and F. Catthoor. Storage size reduction by in-place mapping of arrays. In A. Cortesi, editor, Verification, Model Checking and Abstract Interpretation, Third Int. Workshop, VMCAI 2002. http://citeseer.ist.psu.edu/troncon02storage.html More
@inproceedings{ troncon02storage,
author = "Remko Troncon and Maurice Bruynooghe and Gerda Janssens and Francky Catthoor",
title = "Storage Size Reduction by In-place Mapping of Arrays",
booktitle = "{VMCAI}",
pages = "167-181",
year = "2002",
url = "citeseer.ist.psu.edu/troncon02storage.html" }
Citations (may not include all citations):
132
Dataflow analysis of array and scalar references
- Feautrier - 1991
101
Custom Memory Management Methodology: Exploration of Memory .. (context) - Catthoor, Wuytack et al. - 1998
23
Memory reuse analysis in the polyhedral model
- Wilde, Rajopadhye - 1996 ACM DBLP
21
Austrian Research Institute for Artificial Intelligence (context) - Holzbaur, Manual - 1995
17
Compiling multi-dimensional data streams into distributed DS.. (context) - Vanhoof, Bolsens et al. - 1989
16
Memory size reduction through storage order optimization for..
- De Greef, Catthoor et al. - 1997 ACM DBLP
12
Background memory management for the synthesis of algebraic .. (context) - Verbauwhede, Catthoor et al. - 1989
9
On copy avoidance in single assignment languages
- Debray - 1993 ACM DBLP
8
Optimizing memory usage in the polyhedral model (context) - Quillere, Rajopadhye - 1998
8
Optimizing memory usage in the polyhedral model (context) - Quillere, Rajopadhye - 2000 ACM DBLP
5
Optimizing storage size for static control programs in autom..
- Lefebvre, Feautrier - 1997 ACM DBLP
5
A module based analysis for memory reuse in Mercury
- Mazur, Janssens et al. - 2000 ACM DBLP
4
Storage Size Reduction for Multimedia Applications (context) - De Greef - 1998
3
Reducing storage size for static control programs mapped ont.. (context) - De Greef, Catthoor et al. - 1996
2
Lp solve Mixed Integer Linear Programming solver (context) - Berkelaar - 1995
2
Compile-time memory reuse in logic programming languages thr.. (context) - Gudjonsson, Winsborough - 1999 ACM DBLP
1
Institut de Recherche en Informatique et Systemes Aleatoires (context) - Kumar, Nookala et al. - 2000
1
Institut de Recherche en Informatique et Systemes Aleatoires (context) - Wilde, for et al. - 1993
http://www.cs.unipr.it/ppl/
http://www.SICStus.se
Documents on the same site (http://www.cs.kuleuven.ac.be/~dtai/publications/2002-E.shtml): More
Web Mining - Kosala, al.
(Correct)
Trailing Analysis for HAL - Schrijvers, Banda, Demoen (2002)
(Correct)
Reuse of Results in Termination Analysis of Typed.. - Bruynooghe, Codish.. (2002)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC