Storage Assignment to Decrease Code Size

ACM Transactions on Programming Languages and Systems

Volumn 18, Issue 3, 1996, Pages 235-253

  Liao, Stan ^a   Devadas, Srinivas ^b   Keutzer, Kurt ^a   Tjiang, Steven ^a   Wang, Albert ^a  

^a SYNOPSYS INC   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algorithms; Code size; Compilation; D.3.4 Programming Languages : Processors compilers; Experimentation; Optimization; Storage assignment

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING LANGUAGES; DIGITAL ARITHMETIC; DIGITAL SIGNAL PROCESSING; HEURISTIC METHODS; OPTIMIZATION; PROGRAM COMPILERS; SHIFT REGISTERS;

AUTOINCREMENT; CODE SIZE; COMPILATION; DECREMENT; INDIRECT ADDRESSING MODES; STORAGE ASSIGNMENT;

DIGITAL STORAGE;

EID: 0030149574     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/229542.229543     Document Type: Article

References (16)

1. AHO, A., HOPCROFT, J., AND ULLMAN, J. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass.
2. AHO, A., SETHI, R., AND ULLMAN, J. 1986. Compilers - Principles, Techniques and Tools. Addison-Wesley, Reading, Mass.
3. ARAUJO, G., DEVADAS, S., KEUTZER, K., LIAO, S., MALIK, S., SUDARSANAM, A., TJIANG, S., AND WANG, A. 1995. Challenges in code generation for embedded processors. In Code Generation for Embedded Processors, P. Marwedel and G. Goossens, Eds. Kluwer Academic, Boston, Mass., 48-64.
4. BARTLEY, D. H. 1992. Optimizing stack frame accesses for processors with restricted addressing modes. Softw. Pract. Exper. 22, 2 (Feb.), 101-110.
5. CALLAHAN, D. AND KOBLENZ, B. 1991. Register allocation via hierarchical graph coloring. In Proceedings of the 1991 ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 192-203.
6. CHAITIN, G., AUSLANDER, M., CHANDRA, A., COCKE, J., HOPKINS, M., AND MARKSTEIN, P. 1981. Register allocation via coloring. Comput. Lang. 6, 47-57.
7. ELLIS, J. R. 1985. A Compiler for VLIW Architectures. MIT Press, Cambridge, Mass.
8. FISHER, J. A. 1981. Trace scheduling: A technique for global microcode compaction. IEEE Trans. Comput. C-30, 7, 478-490.
9. FRASER, C. W., MYERS, E. W., AND WENDT, A. L. 1984. Analyzing and compressing assembly code. In Proceedings of 1994 ACM SIGPLAN Symposium on Compiler Construction. ACM, New York, 117-121.
10. GANSSLE, J. G. 1992. The Art of Programming Embedded Systems. Academic Press, San Diego, Calif.
11. GOOSSENS, G., RABAEY, J., CATTHOOR, F., VANHOOF, J., JAIN, R., MAN, H. D., AND VANDEWALLE, J. 1986. A computer-aided design methodology for mapping DSP algorithms onto custom multiprocessor architectures. In Proceedings of the 1986 IEEE International Symposium on Circuits and Systems. IEEE, New York, 924-925.
12. LIAO, S. 1996. Code generation and optimization for embedded digital signal processors. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, Mass.
13. LIEM, C., MAY, T., AND PAULIN, P. 1994. Instruction-set matching and selection for DSP and ASIP code generation. In Proceedings of the 1994 European Design and Test Conference. IEEE, New York.
14. RIMEY, K. 1989. A compiler for application-specific signal processors. Ph.D. thesis, Univ. of California, Berkeley, Calif.
15. ŽIVOJNOVIĆ, V., VELARDE, J. M., AND SCHLÄGER, C. 1994. DSPstone: A DSP-oriented benchmarking methodology. In Proceedings of the 5th International Conference on Signal Processing Applications and Technology. Miller Freeman, San Francisco, Calif.
16. WILSON, R., FRENCH, R., WILSON, C., AMARASINGHE, S., ANDERSON, J., TJIANG, S., LIAO, S.-W., TSENG, C.-W., HALL, M., LAM, M., AND HENNESSY, J. 1994. SUIF: A parallelizing and optimizing research compiler. Tech. Rep. CSL-TR-94-620, Stanford Univ., Stanford, Calif. May.