List-coloring of interval graphs with application to register assignment for heterogeneous register-set architectures

Signal Processing

Volumn 83, Issue 7, 2003, Pages 1411-1425

  Zeitlhofer, Thomas ^a   Wess, Bernhard ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Graph coloring; Heterogeneous register set architectures; Interval graph; List coloring; Register assignment

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; VERY LONG INSTRUCTION WORD ARCHITECTURE;

INTERVAL GRAPHS;

DIGITAL SIGNAL PROCESSING;

EID: 0037508524     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0165-1684(03)00089-6     Document Type: Article

References (23)

1. D.A. Berson, R. Gupta, M.L. Soffa, HARE: a hierarchical allocator for registers in multiple issue architectures, Technical Report TR 95-06, Computer Science Department, University of Pittsburgh, February 1995.
2. Bodlaender H.L. A tourist guide through treewidth. Acta Cybernet. 11:1993;1-21.
3. Bodlaender H.L. A partial. k -arboretum of graphs with bounded treewidth Theoret. Comput. Sci. 209:1998;1-45.
4. Booth K., Lueker G. Testing for the consecutive ones property, interval graphs, and graph planarity using Pq-tree algorithms. J. Comput. System Sci. 13:1976;335-379.
5. Briggs P., Cooper K.D., Torczon L. Improvements to graph coloring register allocation. ACM Trans. Programming Languages Systems. 16(3):1994;428-455.
6. D. Callahan, B. Koblenz, Register allocation via hierarchical graph coloring, in: Proceedings of the ACM Conference on Programming Language Design and Implementation, Toronto, Ontario, Canada, 1991, pp. 192-202.
7. Chaitin G.J. Register allocation & spilling via graph coloring. ACM SIGPLAN Notices. 17(6):1982;98-105.
8. Chaitin G.J., Auslander M.A., Chandra A.K., Cocke J., Hopkins M.E., Markstein P.W. Register allocation via coloring. Comput. Languages. 6:1981;47-57.
9. Z. Chamski, C. Eisenbeis, E. Rohou, Flexible issue slot assignment for VLIW architectures, Fourth International Workshop on Software and Compilers for Embedded Systems, Schloss Rheinfels, St. Goar, Germany, September 1999.
10. Cheng W.-K., Lin Y.-L. Code generation of nested loops for DSP processors with heterogeneous registers and structural pipelining. ACM Trans. Design Automat. Electron. Systems. 4(3):1999;231-256.
11. Chow F.C., Hennessy J.L. Register allocation by priority-based coloring. ACM SIGPLAN Notices. 19(6):1984;222-232.
12. Diestel R. Graph Theory. 2000;Springer, Berlin.
13. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs. 1980;Academic Press, New York.
14. Gravier S., Kobler D., Kubiak W. Complexity of list coloring problems with a fixed total number of colors. Discrete Appl. Math. 117:2002;65-79.
15. Jansen K., Scheffler P. Generalized coloring for tree-like graphs. Discrete Appl. Math. 75:1997;135-155.
16. D.J. Kolson, A. Nicolau, N. Dutt, K. Kennedy, Optimal register assignment to loops for embedded code generation, Technical Report 95-46, University of California, Irvine, July, 1995.
17. Landskov D., Davidson S., Shriver B., Mallett P.W. Local microcode compaction techniques. ACM Comput. Surveys. 12(3):1980;261-294.
18. Lee E.A., Messerschmitt D.G. Static scheduling of synchronous data flow programs for digital signal processing. IEEE Trans. Comput. C-36(1):1987;24-35.
19. Lee E.A., Messerschmitt D.G. Synchronous data flow. Proc. IEEE. 75(9):1987;1235-1245.
20. P. Pinter, Register allocation with instruction scheduling: a new approach, in: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, Albuquerque, 1993, pp. 248-257.
21. van Eijk K., Mesman B., Pinto C.A.A., Zhao Q., Bekooij M., van Meerbergen J., Jess J. Constraint analysis for code generation. basic techniques and applications in FACTS ACM Trans. Design Automat. Electron. Systems. 5(4):2000;774-793.
22. T. Zeitlhofer, B. Wess, Operation scheduling for parallel functional units using genetic algorithms, in: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, Phoenix, AZ, USA, 1999.
23. T. Zeitlhofer, B. Wess, Integrated scheduling and register assignment for VLIW-DSP architectures, in: Proceedings of the 14th IEEE International ASIC/SOC Conference, Washington, DC, USA, 2001, 339-343.