Storage assignment optimizations to generate compact and efficient code on embedded DSPs

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 34, Issue 5, 1999, Pages 128-138

  Rao, Amit ^a   Pande, Santosh ^b  

^a SYNOPSYS INC   (United States)

^b 705 Engineering Research Center   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17244382472     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/301631.301653     Document Type: Article

References (19)

1. A. Aho and J. Ullman. The Theory of Parsing, Translation, and Compiling. Volume II: Compiling. Prentice-Hall, 1973.
2. G. Araujo and S. Malik. Optimal Code Generation for Embedded Memory Non Homogeneous Register Architectures. In Proceedings of International Symposium on System Synthesis, 1995.
3. rd ACM/IEEE Design Automation Conference, pages 591-596, June 1996.
4. G. Araujo, A. Sudarsanam, and S. Malik. Instruction Set Design and Optimization for Address Computation in DSP Architectures. In Proceedings of the 9th International Symposium on System Synthesis, pages 31-37, November 1997.
5. D. Bartley. Optimizing Stack Frame Accesses for Processors with Restricted Addressing Modes. Software - Practice and Experience, 22(2):101-110, February 1992.
6. K. Cooper and P. Schielke. Non-Local Instruction Scheduling with Limited Code Growth. In Proceedings of Languages, Compilers and Tools for Embedded Systems '98 (LCTES'98), pages 193-207, June 1998.
7. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H.Freeman and Co., 1979.
8. D. Kolson et al. Optimal Register Assignment to Loops for Embedded Code Generation. ACM Transactions on Design Automation of Electronic Systems, 1(2):251-279, April 1996.
9. R. Leupers and P. Marwedel. Algorithms for Address Assignment in DSP Code Generation. In Proceedings of International Conference on Computer-Aided Design, pages 109-112, 1996.
10. S. Liao. Code Generation and Optimization for Embedded Digital Signal Processors. PhD thesis, MIT Department of EECS, January 1996.
11. S. Liao et al. Storage Assignment to Decrease Code Size. In Proceedings of the ACM SIGPLAN '95 Conference on Programming Language Design and Implementation, pages 186-195, 1995.
12. S. Liao et al. Storage Assignment to Decrease Code Size. ACM Transactions on Programming Languages and Systems, 18(3):235-253, May 1996.
13. A. Rao. Compiler Optimizations for Storage Assignment on Embedded DSP s. Master's thesis, Dept. of ECECS, Univ. of Cincinnati, October 1998.
14. R. Sethi and J. Ullman. The Generation of Optimal Code for Arithmetic Expressions. Journal of the ACM, 17(4):715-728, October 1970.
15. SPAM Research Group, Princeton University. SPAM Compiler User's Manual, September 1997. http://www.ee.princeton.edu/spam.
16. A. darsanam et al. Optimization of Embedded DSP Programs Using Post-pass Data-flow Analysis. In Proceedings of International Conference on Acoustics, Speech, and Signal Processing, April 1997.
17. A. Sudarsanam, S. Liao, and S. Devadas. Analysis and Evaluation of Address Arithmetic Capabilities in Custom DSP Architectures. In Proceedings of ACM/IEEE Design Automation Conference, pages 287-292, 1997.
18. A. Sudarsanam and S. Malik. Memory Bank and Register Allocation in Software Synthesis for ASIPs. In Proceedings of International Conference on Computer Aided Design, pages 388-392, 1995.
19. Texas Instruments. TMS320C2x User's Guide, January 1993. http://www.ti.com/sc/docs/dsps/literatu.htm.