Browse > Article
http://dx.doi.org/10.3745/KTCCS.2013.2.2.059

An Optimal ILP Algorithm of Memory Access Variable Storage for DSP in Embedded System  

Chang, Jeong-Uk (세명대학교 전산정보학)
Lin, Chi-Ho (세명대학교 컴퓨터학부)
Publication Information
KIPS Transactions on Computer and Communication Systems / v.2, no.2, 2013 , pp. 59-66 More about this Journal
Abstract
In this paper, we proposed an optimal ILP algorithm on memory address code generation for DSP in embedded system. This paper using 0-1 ILP formulations DSP address generation units should minimize the memory variable data layout. We identify the possibility of the memory assignment of variable based on the constraints condition, and register the address code which a variable instructs in the program pointer. If the process sequence of the program is declared to the program pointer, then we apply the auto-in/decrement mode about the address code of the relevant variable. And we minimize the loads on the address registers to optimize the data layout of the variable. In this paper, in order to prove the effectiveness of the proposed algorithm, FICO Xpress-MP Modeling Tools were applied to the benchmark. The result that we apply a benchmark, an optimal memory layout of the proposed algorithm then the general declarative order memory on the address/modify register to reduce the number of loads, and reduced access to the address code. Therefor, we proved to reduce the execution time of programs.
Keywords
DSP; Embedded System; ILP; Meomory Access;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Properties of IIR Filters, http://cnx.org/content/m16898/ latest/#uid6, [Internet], July, 2011.
2 Joachims and Thorsten, "Making large scale SVM learning practical", MIT Press, Cambridge, USA, Oct., 1999.
3 David Mumford , "Varieties Defined by Quadratic Equations", C.I.M.E. Summer Schools, Vol.51, pp.29-100, 2011.
4 Ali Sazegari and Doug Clarke, "Single-channel convolution in a vector processing computer system", Apple Computer Inc., US7895252, Feb., 2011.
5 S. Liao, S. Devadas, K. Keutzer, S. Tjiang, and A. Wang. "Storage assignment to decrease code size". ACM Transactions on Programming Languages and Systems, 18(3), pp.235-253, 1996.   DOI   ScienceOn
6 B. So, M. W. Hall, and H. E. Ziegler. "Custom data layout for memory parallelism", Proceedings of the International Symposium on Code Generation and Optimization, pp. 291-302, 2004.
7 A. Rao and S. Pande. "Storage assignment optimizations to generate compact and efficient code on embedded DSPs", Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, pp. 128-138, 1999.
8 A. Darte, R. Schreiber, and G. Villard. "Lattice-based memory allocation". IEEE Transactions on Computers, 54(10), pp. 1242-1257, October, 2005.   DOI   ScienceOn
9 S. Leventhal, L. Yuan, N. K. Bambha, S. S. Bhattacharyya and G. Qu, "DSP address optimization using evolutionary algorithms", Proceedings of the 2005 workshop on Software and compilers for embedded systems, pp.91-98, 2005.
10 J.-Y. Lee and I.-C. Park. "Address code generation for DSP instruction-set architectures", ACM Transactions on Design Automation of Electronic Systems, 8(3), pp.384-395, 2003.   DOI   ScienceOn
11 G. Chen and M. Kandemir. "Optimizing Address Code Generation for Array-Intensive DSP Applications", Proceedings of the international symposium on Code generation and optimization, pp.141-152, 2005.
12 FICO Xpress-MP, http://www.dashoptimization.com/pdf/ Mosel1.pdf, [Internet], 2002.
13 Anuj Dharia and Rosham Gummattira, "Signal Processing Examples Using the TMS320C67x Digital Signal Processing Library(DSPLIB)", Texas Instruments SPRA947A, June, 2009.