Global array reference allocation

ACM Transactions on Design Automation of Electronic Systems

Volumn 7, Issue 2, 2002, Pages 336-357

  Araujo, Guido ^a   Ottoni, Guilherme ^a   Cintra, Marcelo ^b  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b Mindspeed Technologies   (United States)

Author keywords

Address registers; Auto increment addressing modes; DSPs; Register allocation

Indexed keywords

ALGORITHMS; EMBEDDED SYSTEMS; OPTIMIZATION; PROGRAM COMPILERS; PROGRAM PROCESSORS;

GLOBAL ARRAYS;

ARRAYS;

EID: 0036016179     PISSN: 10844309     EISSN: None     Source Type: Journal    
DOI: 10.1145/544536.544542     Document Type: Article

References (37)

1. Aho, A. and Johnson, S. 1976. Optimal code generation for expression trees. Journal of the ACM 23, 3 (July), 488-501.
2. Aho, A., Johnson, S., and Ullman, J. 1977a. Code generation for expressions with common subexpressions. Journal of the ACM 24, 1 (Jan.), 146-160.
3. Aho, A., Johnson, S., and Ullman, J. 1977b. Code generation for machines with multiregister operations. In Proceedings of the 4th ACM Symposium on Principles of Programming Languages. 21-28.
4. Aho, A., Sethi, R., and Ullman, J. 1986. Compilers, Principles, Techniques and Tools. Addison Wesley, Boston, MA.
5. Analog Devices. 1995. ADSP-2100 Family User's Manual. Analog Devices.
6. Appel, A. and Supowit, K. 1987. Generalizations of the Sethi-Ullman algorithm for register allocation. Software Practice and Experience 17, 3 (June), 417-421.
7. Araujo, G. 1997. Code generation algorithms for digital signal processors. Ph.D. thesis, Princeton University, Princeton, NJ.
8. Araujo, G., Sudarsanam, A., and S., M. 1996. Instruction set design and optimizations for address computation in DSP processors. In Proceedings of the 9th International Symposium on Systems Synthesis. IEEE Computer Society Press, Los Alamitos, CA, 31-37.
9. Bartley, D.H. 1992. Optimizing stack frame accesses for processors with restricted addressing modes. Softw. Practice Experience 22, 2 (Feb.), 101.
10. Basu, A., Leupers, R., and Marwedel, P. 1999. Array index allocation under register constraints in DSP programs. In Proceedings of the International Conference on VLSI Design. IEEE Press, Los Alamitos, CA.
11. Bodik, R. and Gupta, R. 1996. Array data-flow analysis for load-store optimizations in superscalar architectures. Int. J. Parallel Program. 24, 6, 481-512.
12. Boesch, F. and Gimpel, J. 1977. Covering the points of a digraph with point-disjoint paths and its application to code optimization. Journal of the ACM 24, 2 (April), 192-198.
13. Bradlee, D., S.J., E., and Henry, R. 1991. Integrating register allocation and instruction scheduling for RISCs. In Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems. 122-131.
14. Briggs, P., Cooper, K., Kennedy, K., and Torczon, L. 1989. Coloring heuristics for register allocation. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM Press, New York, NY, 275-284.
15. Bruno, J. and Sethi, R. 1975. The generation of optimal code for stack machines. Journal of the ACM 22, 3 (July), 382-396.
16. Bruno, J. and Sethi, R. 1976. Code generation for one-register machine. Journal of the ACM 23, 3 (July), 502-510.
17. Callahan, D., Carr, S., and Kennedy, K. 1990. Improving register allocation for subscripted variables. In Proceedings of the ACM SIGPLAN Conference on Programming Languages Design and Implementation. ACM Press, New York, NY, 53-65.
18. Callahan, D. and Koblenz, B. 1991. Register allocation via hierarchical graph coloring. In Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation. ACM Press, New York, NY, 192-202.
19. Chaitin, G. 1982. Register allocation and spilling via graph coloring. In Proceedings of the ACM SIGPLAN'82 Symposium on Compiler Construction. ACM Press, New York, NY, 98-105.
20. Chow, F. and Hennessy, J.L. 1990. The priority-based coloring approach to register allocation. ACM Trans. Program. Lang. Syst. 12, 4 (Oct.), 501-536.
21. Cytron, R., Ferrante, J., Rosen, B., Wegman, M., and Zadeck, F. 1989. An efficient method of computing static single assignment form. In Proceedings of the ACM POPL'89. ACM Press, New York, NY, 23-25.
22. Eckstein, E. and Krall, A. 1999. Minimizing cost of local variables access for DSP-processors. In Proceedings of the ACM SIGPLAN 1999 Workshop on Languages, Compilers, and Tools for Embedded Systems. ACM Press, New York, NY, 20-27.
23. Gebotys, C. 1997. DSP address optimization using a minimum cost circulation technique. In Proceedings of the International Conference on Computer-Aided Design. IEEE Computer Society Press, Los Alamitos, CA, 100-103.
24. Goodman, J. and Hsu, A. 1988. Code scheduling and register allocation in large basic blocks. In Proceedings of the 1988 Conference on Supercomputing. 442-452.
25. Gupta, R., Soffa, M., and Ombres, D. 1994. Efficient register allocation via coloring using clique separators. ACM Trans. Program. Lang. Syst. 16, 3 (May), 370-386.
26. Hitchcock III, C.Y. 1986. Addressing modes for fast and optimal code generation. Ph.D. thesis, Carnegie-Mellon University, Pittsburgh, PA.
27. Horwitz, L., Karp, R., Miller, R., and Winograd, S. 1966. Index register allocation. Journal of the ACM 13, 1 (Jan.), 43-61.
28. Leupers, R., Basu, A., and Marwedel, P. 1998. Optimized array index computation in DSP programs. In Proceedings of the ASP-DAC. IEEE Computer Society Press, Los Alamitos, CA.
29. Leupers, R. and David, F. 1998. A uniform optimization technique for offset assignment problems. In Proceedings of the ACM SIGDA 11th International Symposium on System Synthesis. ACM Press, New York, NY, 3-8.
30. Liao, S., Devadas, S., Keutzer, K., Tjiang, S., and Wang, A. 1995. Storage assignment to decrease code size. In Proceedings of 1995 ACM Conference on Programming Language Design and Implementation. ACM Press, New York, NY.
31. Muchnick, S.S. 1997. Advanced Compiler Design and Implementation. Morgan Kaufmann San Francisco, CA.
32. Ottoni, G., Rigo, S., Araujo, G., Rajagopalan, S., and Malik, S. 2001. Optimal Live Range Merge for Address Register Allocation in Embedded Programs. In Proceedings of the 10th International Conference on Compiler Construction (CC2001). Lecture Notes in Computer Science, vol. 2027. Springer, Berlin, Germany, 274-288.
33. Rao, A. and Pande, S. 1999. Storage assignment optimizations to generate compact and efficient code on embedded DSPs. In Proceedings of the ACM SIGPLAN 1999 Conference on Programming Language Design and Implementation. ACM Press, New York, NY, 128-138.
34. Sethi, R. 1975. Complete register allocation problems. SIAM J. Comput. 4, 3 (Sept.), 226-248.
35. Sethi, R. and Ullman, J. 1970. The generation of optimal code for arithmetic expressions. Journal of the ACM 17, 4 (Oct.), 715-728.
36. Tarjan, R.E. 1983. Data Structures and Network Algorithms. SIAM, Philadelphia, PA.
37. Zivojnovic, V., Velarde, J., and Sclåager, C. 1994. DSPstone, a DSP benchmarking methodology. Technical report, Aachen University of Technology (Aug.), Aachen, Germany.