Optimal register assignment to loops for embedded code generation

ACM Transactions on Design Automation of Electronic Systems

Volumn 1, Issue 2, 1996, Pages 251-279

  Kolson, David J ^a   Nicouuj, Alexandru ^a   Dutt, Nikil ^a   Kennedy, Ken ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Rice University   (United States)

Author keywords

Code generation; Embedded systems; System design

Indexed keywords

EID: 0000738903     PISSN: 10844309     EISSN: None     Source Type: Journal    
DOI: 10.1145/233539.233542     Document Type: Article

References (28)

1. AHMED, I. AND CHEN, C. Y. R. 1991. Post-processor for datapath synthesis using multiport memories. In Proceedings of the ACMI IEEE International Conference on CAD. (San Jose, CA, Nov.) 276-279.
2. AHO, A. H., SETHI, R., AND ULLMAN, J. D. 1986. Compilers: Principles, Techniques and Tools. Addison-Wesley, Reading, MA.
3. BALAKRISHNAN, M., ET AL. 1988. Allocation of multiport memories in data path synthesis. IEEE Trans. Comput.-Aided Des., 7, 4 (April), 536-540.
4. BRIGGS, P. 1992. Register coloring via graph coloring. Rice University, Ph.D. Thesis, April.
5. BRIGGS, P., COOPER, K., KENNEDY, K, AND TORCZON, L. 1989. Coloring heuristics for register allocation. Proceedings of the SIGPLAN Conference on Programming Languages Design and Implementation (Portland, OR, June) 275-284.
6. CHAITIN, G., AUSLANDER, M., CHANDRA, A., COOCKE, J., HOPKINS, M., AND MARKSTEIN, P. 1981. Register allocation via coloring. Comput. Lang. 6 (Jan.), 47-57.
7. CHOW, F. AND HENNESSY, J. 1990. The priority-based coloring approach to register allocation. ACM Trans. Program. Lang. Syst. 12, 4 (Oct.), 501-536.
8. FEUERHAHN, H. 1988. Data-flow driven resource allocation in a retargetahle microcode compiler. In Proceedings of the International Symposium on Microarchitecture.
9. GRANLUND, T. AND KENNER, R. 1992. Eliminating branches using a superoptimizer and the GNU C compiler. In Proceedings of the SIGPLAN Conference on Programming Languages Design and Implementation (San Francisco, CA, July), 341-352.
10. HENDREN, L. J., GAO, G. R., ALTMAN, E., AND MUKERJI, C. 1992. A register allocation framework based on hierarchical cyclic interval graphs. In International Conference on Compiler Construction (Panderborn, Germany, April), 176-191.
11. HORWITZ, L. P., KARP, R. M., MILLER, R. E., AND WINOGRAD, S. 1966. Index register allocation. J. ACM, 13, 1 (Jan.).
12. Hsu, W., FISCHER, C., AND GOODMAN, J. 1989. On the minimization of loads/stores in local register allocation. IEEE Trans. Softw. Eng., 15, 10 (Oct.), 1252-1260.
13. KENNEDY, K. 1972. Index register allocation in straight line code and simple loops. In Design and Optimization of Compilers, R. Rustin, Ed. Prentice-Hall, Englewood Cliffs, NJ, 51-63.
14. KlM, T. AND LlU, C. L. 1993. Utilization of multiport memories in data path synthesis. In Proceedings of the 30th DAC (Dallas, TX, June), 298-302.
15. KURDAHI, F. J. AND PARKER, A. C. 1987. REAL: A program for register allocation. In Proceedings of the 24th DAC (Miami, FL, June) 210-215.
16. LANNEER, D., CORNERO, M., GOOSSENS, G., AND DE MAN, H. 1994. Data routing: A paradigm for efficient data-path synthesis and code generation. In Proceedings of the International Symposium on High-Level Synthesis (Niagara-on-the Lake, Ont. Canada, May), 17-22.
17. LIAO, S., DEVADAS, S., KEUTZER, K., AND TJIANG, S. 1995. Instruction selection using binate covering for code size optimization. In Proceedings of the ACMI IEEE International Conference on Computer-Aided Design 95 (San Jose, CA, Nov.), 393-399.
18. LIEM, C., MAY, T., AND PAULIN, P. 1994. Register assignment through resource classification for ASIP microcode generation. In Proceedings of the ACM/IEEE International Conference on Computer-Aided Design (San Jose, CA, Nov.), 397-402.
19. LUCCIO, F. 1967. A comment on index register allocation. Commun. ACM 10, 9 (Sept.), 572-574.
20. MARWEDEL, P. 1984. The MIMOLA design system: Tools for the design of digital processors. In Proceedings ofDAC-84 (Albuquerque, NM, June) 586-593.
21. MARWEDEL, P. 1993. Tree-based mapping of algorithms to predefined structures. In Proceedings of ACM/IEEE International Conference on Computer-Aided Design (San Jose, CA, Nov.), 587-593.
22. MARWEDEL, P. AND GOOSSENS, G. 1995. Code Generation for Embedded Processors. Kluwer Academic, Nonvell, MA.
23. PARK, C., KIM, T., AND Liu, C. L. 1993. Register allocation for data flow graphs with conditional branches and loops. In Proceedings of European Design Automation Conference (Euro-DAC). (Hamburg, Germany) 232-237.
24. PAULIN, P. G. AND KNIGHT, J. P. 1989. Force-directed scheduling for the behavioral synthesis of ASICs. IEEE Trans. Comput.-Aided Des. Integrated Circuits Syst. 8, 6 (June).
25. STALLMAN, R. M. 1992. Using and Porting GNU CC. Free Software Foundation.
26. STOK, L. 1990. Interconnect optimisation during data path allocation. In Proceedings of European Design Automation Conference (Edinburgh, Scotland, March) 141-145.
27. STRIK, M., VAN MEERBERGEN, J., TIMMER, A., JESS, J., AND NOTE, S. 1995. Efficient code generation for in-house DSP-cores. In Proceedings of the European Design and Test Conference (Paris, May) 244-249.
28. WILSON, T., GREWAL, G., HALLEY, B., AND BANERJI, D. 1994. An integrated approach to retargetable code generation. In Proceedings of the International Symposium on High-Level Synthesis (Niagara-on-the Lake, Ont., Canada, May) 70-75.