ACM Home Page
Please provide us with feedback. Feedback
Systematic intermediate sequence removal for reduced memory accesses
Full text PdfPdf (586 KB)
Source ACM International Conference Proceeding Series; Vol. 235 archive
Proceedingsof the 10th international workshop on Software & compilers for embedded systems table of contents
Nice, France
SESSION: Memory-aware compilation table of contents
Pages: 51 - 60  
Year of Publication: 2007
Authors
Christophe Poucet  DDT/IMEC, Leuven, Belgium
Stylianos Mamagkakis  DDT/IMEC, Leuven, Belgium
David Atienza  DACYA/UCM, Madrid, Spain
Francky Catthoor  DDT/IMEC, Leuven, Belgium
Sponsors
: Artist2 European NoE
: ACE Associated Compiler Experts bv
SIGBED: ACM Special Interest Group on Embedded Systems
: European Design and Automation Association, EDAA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 24,   Citation Count: 0
Additional Information:

abstract   references   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1269843.1269851
What is a DOI?

ABSTRACT

Modern software applications are growing in complexity and demand very intensive use of data. Therefore, a wide variety of data structures are utilized to facilitate the storage and access to these vast amounts of computed information. Additionally, the need for reliable software design and the development of large applications following the object-oriented paradigm increase the amount of dynamic buffers and redundant accesses to the data stored in these buffers. In this paper, we propose a systematic, design optimization methodology to remove these intermediate dynamic buffers, thereby reducing the memory accesses of the targeted applications without altering the input-output behaviour of the algorithms. The reduction is focused on sequences and is especially relevant for embedded systems, which have limited on-chip communication bandwidth and the energy consumption of the memory subsystem is high, due to the energy consumption associated with each memory access. The effectiveness of the proposed methodology is assessed in a 3D reconstruction multimedia application and shows a significant reduction in memory accesses. In addition, the general trends for memory improvement and the scalability of our approach are supported as well by a parameterized benchmark set.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
 
4
J. Beyer. Cbench: Compiler benchmark, 2006. http://cbench.sourceforge.net.
5
 
6
 
7
E. De Greef. Storage Size Reduction for Multimedia Applications. PhD thesis, Katholieke Universiteit Leuven, January 1998.
 
8
D. Renz et al. Implementing lazy streams in c++. Morehead Electronic Journal of Applicable Mathematics, 4, May 2005.
9
 
10
S. M. Inc. The collections framework, 2005. http://java.sun.com/docs/books/tutorial/collections/.
 
11
 
12
M. Leeman et al. Methodology for refinement and optimisation of dynamic memory management for embedded systems in multimedia applications. In SIPS, August 2003.
 
13
 
14
Micron Technology, Inc. 128MSDRAM. http://www.micron.com/dram.
 
15
 
16
 
17
Glassgow haskell compiler. http://www.haskell.org/ghc/.
18
 
19
20
 
21
 
22
A. Santos. Compilation by Transformation in Non-Strict Functional Languages. PhD thesis, 1995.
 
23
SGI. Standard template library, 2006. http://www.sgi.com/tech/stl/.
 
24
Target jr, 2002. http://www.targetjr.org.
 
25
D. van Arkel et al. Fusion in practice. In In Implementation of Functional Languages, (LNCS), 2002.
26
 
27
Collaborative Colleagues:
Christophe Poucet: colleagues
Stylianos Mamagkakis: colleagues
David Atienza: colleagues
Francky Catthoor: colleagues