Array composition and decomposition for optimizing embedded applications

被引:0
作者
Chen, G [1 ]
Kandemir, M [1 ]
Nadgir, A [1 ]
Sezer, U [1 ]
机构
[1] Penn State Univ, University Pk, PA 16802 USA
来源
ICCAD-2003: IEEE/ACM DIGEST OF TECHNICAL PAPERS | 2003年
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Optimizing array accesses is extremely critical in embedded computing as many embedded applications make use of arrays (in form of images, video frames, etc). Previous research considered both loop and data transformations for improving array accesses. However, data transformations considered were mostly limited to linear data transformations and array interleaving. In this paper, we introduce two data transformations: array decomposition (breaking up a large array into multiple smaller arrays) and array composition (combining multiple small arrays into a single large array). This paper discusses that it is feasible to implement these optimizations within an optimizing compiler.
引用
收藏
页码:193 / 196
页数:4
相关论文
共 10 条
[1]  
Catthoor Francky, 1998, CUSTOM MEMORY MANAGE
[2]  
CIERNIAK M, 1995, P SIGPLAN 95 C PROGR
[3]  
DING C, 1999, P WORKSH LANG COMP P
[4]  
KELLY W, 1995, CSTR3445 U MAR
[5]  
LEUNG ST, 1995, 950901 U WASH DEP CO
[6]  
LI W, 1993, THESIS CORNELL U ITH
[7]  
MCKINELY K, 1996, ACM T PROGRAMMING LA
[8]  
Wolf M. E., 1991, SIGPLAN Notices, V26, P30, DOI 10.1145/113446.113449
[9]  
Wolfe M.J., 1996, High Performance Compilers For Parallel Computing
[10]  
[No title captured]