We solve the problem of integrating modulo scheduling with instruction selection (including cluster assignment), instruction scheduling and register allocation, with optimal spill code generation and scheduling. Our method is based on integer linear programming. We prove that our algorithm delivers optimal results in finite time for a certain class of architectures. We believe that these results are interesting both from a theoretical point of view and as a reference point when devising heuristic methods. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Eriksson, M. V., & Kessler, C. W. (2009). Integrated modulo scheduling for clustered VLIW architectures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5409 LNCS, pp. 65–79). https://doi.org/10.1007/978-3-540-92990-1_7
Mendeley helps you to discover research relevant for your work.