Fast optimal instruction scheduling for single-issue processors with arbitrary latencies

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2239, Issue , 2001, Pages 625-639

  Van Beek, Peter ^a   Wilken, Kent ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b Davis   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; DIGITAL ARITHMETIC; HEURISTIC METHODS; INTEGER PROGRAMMING; OPEN SOURCE SOFTWARE; PROGRAM COMPILERS;

CONSTRAINT PROGRAMMING; GNU COMPILER COLLECTION; INSTRUCTION SCHEDULES; INSTRUCTION SCHEDULING; INTEGER LINEAR PROGRAMMING; REDUNDANT CONSTRAINTS; RESOURCE CONSTRAINT; STANDARD CONSTRAINTS;

SCHEDULING;

EID: 84947913653     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45578-7_52     Document Type: Conference Paper

References (22)

1. S. Arya. An optimal instruction-scheduling model for a class of vector processors. IEEE Transactions on Computers, C-34(11):981–995, 1985.
2. D. Bernstein and I. Gertner. Scheduling expressions on a pipelined processor with a maximal delay of one cycle. ACM Transactions on Programming Languages and Systems, 11(1):57–66, 1989.
3. D. Bernstein, M. Rodeh, and I. Gertner. On the complexity of scheduling problems for parallel/pipelined machines. IEEE Transactions on Computers, 38(9):1308–1313, 1989.
4. J. Carlier and E. Pinson. Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research, 78:146–161, 1994.
5. C.-M. Chang, C.-M. Chen, and C.-T. King. Using integer programming for instruction scheduling and register allocation in multi-issue processors. Computers and Mathematics with Applications, 34(9):1–14, 1997.
6. R. Dechter. Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. Artificial Intelligence, 41:273–312, 1990.
7. M. A. Ertl and A. Krall. Optimal instruction scheduling using constraint logic programming. In Programming Language Implementation and Logic Programming (PLILP), 1991.
8. J. Hennessy and T. Gross. Postpass code optimization of pipeline constraints. ACM Transactions on Programming Languages and Systems, 5(3):422–448, 1983.
9. J. Hennessy and D. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufmann, second edition, 1996.
10. C. W. Kessler. Scheduling expression DAGs for minimal register need. Computer Languages, 24(1):33–53, 1998.
11. C. Le Pape and P. Baptiste. Constraint-based scheduling: A theoretical comparison of resource constraint propagation rules. In Proceedings of the ECAI Workshop on Non-Binary Constraints, Brighton, UK, August 1998.
12. M. Leconte. A bounds-based reduction scheme for constraints of difference. In Proceedings of the Constraint-96 International Workshop on Constraint-Based Reasoning, pages 19–28, Key West, Florida, May 1996.
13. C. Lee, M. Potkonjak, and W. Manginoe-Smith. MediaBench: A tool for evaluating and synthesizing multimedia and communications. In Proceedings of International Symposium on Microarchitecture, pages 330–335, December 1997.
14. R. Leupers and P. Marwedel. Time-constrained code compaction for DSPs. IEEE Trans. VLSI Systems, 5(1):112–122, 1997.
15. K. Marriott and P. J. Stuckey. Programming with Constraints. The MIT Press, 1998.
16. K. Mehlhorn and S. Thiel. Faster algorithms for bound-consistency of the sortedness and alldifferent constraint. In Proceedings of the Sixth International Conference on Principles and Practice of Constraint Programming, pages 306–319, Singapore, September 2000.
17. S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufmann, 1997.
18. K. Palem and B. Simons. Scheduling time-critical instructions on RISC machines. ACM Transactions on Programming Languages and Systems, 15(4):632–658, 1993.
19. P. Prosser, K. Stergiou, and T. Walsh. Singleton consistencies. In Proceedings of the Sixth International Conference on Principles and Practice of Constraint Programming, pages 353–368, Singapore, September 2000.
20. J.-F. Puget. A fast algorithm for the bound consistency of alldiff constraints. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, pages 359–366, Madison, WI, July 1998.
21. K. Wilken, J. Liu, and M. Heffernan. Optimal instruction scheduling using integer programming. In Proceedings of the SIGPLAN 2000 Conference on Programming Language Design and Implementation (PLDI), pages 121–133, Vancouver, BC, June 2000.
22. H. Wu, J. Jaffar, and R. Yap. Instruction scheduling with timing constraints on a single RISC processor with 0/1latencies. In Proceedings of the Sixth International Conference on Principles and Practice of Constraint Programming, pages 457–469, Singapore, September 2000.