Optimizing address code generation for array-intensive DSP applications

Proceedings of the 2005 International Symposium on Code Generation and Optimization, CGO 2005

Volumn 2005, Issue , 2005, Pages 141-152

  Chen, Guilin ^a   Kandemir, Mahmut ^a  

^a The Pennsylvania State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARRAY-INTENSIVE EMBEDDED APPLICATIONS; DSP DOMAIN; TARGET EFFECTIVE ADDRESS CODE;

COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING; PROGRAM COMPILERS; SIGNAL PROCESSING;

EMBEDDED SYSTEMS;

EID: 33646823956     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (57)

1. G. Araujo, A. Sudarsanam, and S. Malik. Instruction set design and optimizations for address computation in DSP architectures. In Proceedings of the International Symposium on System Synthesis, 1996.
2. D. Bartley. Optimizing stack frame accesses for processors with restricted addressing modes. Software - Practice and Experience, 22(2):101-110, February 1992.
3. A. Basu, R. Leupers, and P. Marwedel. Array index allocation under register constraints in DSP programs. In Proceedings of the 12th International Conference on VLSI Design, Goa, India, January 1999.
4. P. Briggs. Register Allocation via Graph Coloring, Ph.D. Thesis, Computer Science Department, Rice University, April 1992.
5. D. Callahan, S. Carr, and K. Kennedy. Improving register allocation for subscripted variables. In Proceedings of the Conference on Programming Language Design and Implementation, 1990.
6. W.-K. Cheng and Y.-L. Lin. Addressing optimization for loop execution targeting DSPs with autoincrement/decrement architecture. In Proceedings of the 11th Symposium on System Synthesis, 1998.
7. M. Cierniak and W. Li. Unifying data and control transformations for distributed shared memory machines. In Proceedings of the Conference on Programming Language Design and Implementation, 1995.
8. M. Cintra and G. Araujo. Array reference allocation using SSA-form and live range growth. In Proceedings of the ACM Workshop on Languages, Compilers, and Tools for Embedded Systems, 2000.
9. S. Coleman and K. McKinley. Tile size selection using cache organization and data layout. In Proceedings of the Conference on Programming Language Design and Implementation, 1995.
10. A. Darte, R. Schreiber, and G. Villard. Lattice-based memory allocation. In Proceedings of the International Conference on Compilers, Architectures and Synthesis for Embedded Systems, 2003.
11. S. Debray and W. Evans. Profile-guided code compression. In Proceedings of the Conference on Programming Language Design and Implementation, 2002.
12. E. Eckstein and A. Krall. Minimizing cost of local variables access for DSP-processors. In Proceedings of the Workshop on Languages, Compilers, and Tools for Embedded Systems, pp. 20-27, 1999.
13. B. Franke and M. F. P. O'Boyle. Array recovery and high-level transformations for DSP applications. ACM Transactions on Embedded Computing Systems, Volume 2, Issue 2, May 2003.
14. C. Gebotys. DSP address optimization using a minimum cost circulation technique. In Proceedings of the International Conference on Computer-Aided Design, 1997.
15. E. De Greef, F. Catthoor, and H. De Man. Memory size reduction through storage order optimization for embedded parallel multimedia applications. Parallel Computing, v.23 n.12, pp. 1811-1837, 1997.
16. M. Kandemir, A. Choudhary, J. Ramanujam, and P. Banerjee. Improving locality using loop and data transformations in an integrated framework. In Proceedings of the International Symposium on Microarchitecture, Dallas, Texas, 1998.
17. M. Kandemir, M. J. Irwin, G. Chen, and J. Ramanujam. Address register assignment for reducing code size. In Proceedings of the 12th International Conference on Compiler Construction, 2003.
18. D. Kirovsky, J. Kin, and W. H. Mangione-Smith. Procedure based program compression. In Proceedings of the 30th International Symposium on Computer Architecture, 1997.
19. I. Kodukula, N. Ahmed, and K. Pingali. Data-centric multi-level blocking. In Proceedings of the Conference on Programming Language Design and Implementation, 1997.
20. N. Kogure, N. Sugino, and A. Nishihara. Memory address allocation method for a DSP with ±2 update operations in indirect addressing. In Proceedings of the European Conference on Circuit Theory and Design, Budapest, Hungary, 1997.
21. B. Kolman. Introductory Linear Algebra with Applications. Sixth Edition, Prentice Hall, Upper Saddle River, New Jersey, 1997.
22. I. Kolcu. Personal communication.
23. J.-S. Lee, W.-K. Hong, and S.-D. Kim. Design and evaluation of a selective compressed memory system. In Proceedings of the IEEE International Conference on Computer Design, Austin, Texas, 1999.
24. 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):384-395, 2003.
25. C. Lefurgy, P. Bird, I.-C. Chen, and T. Mudge. Evaluation of a high performance code compression method. In Proceedings of the 33th International Symposium on Computer Architecture, 1997.
26. C. Lefurgy, E. Piccininni, and T. Mudge. Improving code density using compression techniques. In Proceedings of the 32th International Symposium on Microarchitecture, Haifa, Israel, November 1999.
27. S.-T. Leung and J. Zahorjan. Optimizing data locality by array restructuring. Technical Report TR 95-09-01, Department of Computer Science and Engineering, University of Washington, 1995.
28. R. Leupers. Offset assignment showdown: evaluation of DSP address code optimization algorithms. In Proceedings of the 12th International Conference on Compiler Construction, 2003.
29. R. Leupers and F. David. A uniform optimization technique for offset assignment problems. In Proceedings of the International Symposium on System Synthesis, Hsinchu, Taiwan, December 1998.
30. R. Leupers and P. Marwedel. Algorithms for address assignment in DSP code generation. In Proceedings of the International Conference on Computer Aided Design, pp. 109-112, November 1996.
31. R. Leupers, A. Basu, and P. Marwedel. Optimized array index computation in DSP programs. In Proceedings of the Asia-South Pacific Design Automation Conference, Yokohama, Japan, February 1998.
32. W. Li. Compiler cache optimizations for banded matrix problems. In Proceedings of the ACM International Conference on Supercomputing, Barcelona, Spain, July 1995.
33. S. Liao. Code Generation and Optimization for Embedded Digital Signal Processors, Ph.D. Thesis, Department of Electrical Engineering and Computer Science MIT, June 1996.
34. 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):235-253, 1996.
35. C. Liem, P. Paulin, and A. Jerreya. Address calculation for retargetable compilation and exploration of instruction set architectures. In Proceedings of the ACM Design Automation Conference, 1996.
36. MediaBench. http://cares.icsl.ucla.edu/MediaBench/.
37. MiBench. http://www.eecs.umich.edu/mibench/.
38. S. S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufmann Publishers, 1st Edition, July 1997.
39. M. Naik and J. Palsberg. Compiling with code size constraints. In Proceedings of ACM Joint Conference on Languages, Compilers, and Tools for Embedded Systems and Software and Compilers for Embedded Systems, Berlin, Germany, June 2002.
40. G. Ottoni, S. Rigo, G. Araujo, S. Rajagopalan, and S. Malik. Optimal live range merge for address register allocation in embedded programs. In Proceedings of the International Conference on Compiler Construction, Genova, Italy, 2001.
41. J. Ramanujam, J. Hong, M. Kandemir, and S. Atri. Address register-oriented optimizations for embedded processors. In Proceedings of the 9th Workshop on Compilers for Parallel Computers, 2001.
42. A. Rao and S. Pande. Storage assignment optimizations to generate compact and efficient code on embedded DSPs. In Proceedings of the Conf. on Programming Language Design and Implementation, 1999.
43. B. So, M. W. Hall, and H. E. Ziegler. Custom data layout for memory parallelism. In Proceedings of the International Symposium on Code Generation and Optimization, Palo Alto, California, 2004.
44. A. Sudarsanam, S. Liao, and S. Devadas. Analysis and evaluation of address arithmetic capabilities in custom DSP architectures. In Proceedings of the ACM Design Automation Conference, 1997.
45. Target Compiler Technologies, http://www.retarget.com.
46. TMS320C6000 CPU and Instruction Set Reference Guide. http://focus.ti.com/ lit/ug/spru189f/spru189f.pdf.
47. S. Udayanarayanan and C. Chakrabarti. Address code generation for DSPs. In Proceedings of the Design Automation Conference, 2001.
48. O. Waddell and R. K. Dybvig. Fast and effective procedure inlining. In Proceedings of the 4th International Symposium on Static Analysis, Springer-Verlag Lecture Notes in Computer Science 1302, 1997.
49. B. Wess. Minimization of data address computation overhead in DSPs. In Proceedings of the International Workshop on Software and Compilers for Embedded Systems, 1998.
50. B. Wess and M. Gotsclich. Optimal DSP memory layout generation as a quadratic assignment problem. In Proceedings of the International Symposium on Circuits and Systems, June 1997.
51. R. Wilson et al. SUIF: an infrastructure for research on parallelizing and optimizing compilers. SIGPLAN Notices, 29(12):31-37, 1994.
52. M. Wolfe. High Performance Compilers for Parallel Computing, Addison-Wesley Publishing Company, 1996.
53. Y. Xie, H. Lekatsas, and W. Wolf. Compression ratio and decompression overhead tradeoffs in code compression for VLIW architectures. In Proceedings of the International Conference onASICs. 2001.
54. Y. Xie, W. Wolf, and H. Lekatsas. A code decompression architecture for VLIW processors. In Proceedings of the 34th International Symposium on Microarchitecture, Austin, Texas, December 2001.
55. N. D. Zervas, K. Masselos, and C. Goutis. Code transformations for embedded multimedia applications: impact on power and performance. In Proceedings of ISCA Power-Driven Microarchitecture Workshop, 1998.
56. H. Zhou and T. M. Conte. Code size efficiency in global scheduling for ILP processors. In Proceedings of the 6th Annual Workshop on Interaction between Compilers and Computer Architectures, 2002.
57. X. Zhuang, C. Lau, and S. Pande. Storage assignment optimizations through variable coalescence for embedded processors. In Proceedings of the ACM SIGPLAN Conference on Language, Compiler, and Tool Support for Embedded Systems, pp. 220-231, 2003.