Scheduling time-constrained instructions on pipelined processors

ACM Transactions on Programming Languages and Systems

Volumn 23, Issue 1, 2001, Pages 73-103

  Leung, Allen ^b   Palem, Krishna V ^a   Pnueli, Amir ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Algorithms; D.3.4 Programming Languages : Processors code generation; F.2.2 Analysis of Algorithms and Problem Complexity : Nonnumerical Algorithms and Problems sequencing and scheduling; Optimization

Indexed keywords

GENERALIZATION METHODS; OPTIMAL GREEDY SOLUTIONS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONCURRENCY CONTROL; CONSTRAINT THEORY; ITERATIVE METHODS; MATHEMATICAL MODELS; OPTIMIZATION; REDUCED INSTRUCTION SET COMPUTING; SCHEDULING;

PIPELINE PROCESSING SYSTEMS;

EID: 0042908988     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/383721.383733     Document Type: Article

References (45)

1. ALLAN, V., BEATY, S. J., SU, B., AND SWEANY, P. H. 1998. Building a retargetable local instruction scheduler. Software: Practice and Experience.
2. ALLAN, V., SU, B., WIJAYA, P., AND WANG, J. 1992. Foresighted compaction under timing constraints. IEEE Transactions on Computers 41, 9, 1169-1172.
3. BEATY, S. J. 1992. Lookahead scheduling. In Proceedings of the 25th Annual International Symposium on Microarchitecture (MICRO-85). Portland, Oregon.
4. BEATY, S. J. 1994. List scheduling: Alone, with foresight, and with lookahead. In In Conference on Massively Parallel Computing Systems (MPCS): the Challenges of General-Purpose and Special-Purpose Computing.
5. BERNSTEIN, D. AND GERTNER, I. 1989. Scheduling expressions on a pipelined processor with a maximal delay of one cycle. ACM Transactions on Programming Languages and Systems 11, 1, 57-66.
6. BERNSTEIN, D. AND RODEH, M. 1991. Global instruction scheduling for superscalar machines. Proceedings of SIGPLAN'91 Conference on Programming Language Design and Implementation.
7. BRUCKER, P. AND KNUST, S. 1998. Complexity results for single-machine problems with positive finish-start time-lags. Osnabruecker Schriften zur Mathematik, Reihe P, Nr. 202.
8. BRUNO, J., JONES, J., AND SO, K. 1980. Deterministic scheduling with pipelined processors. IEEE Transactions of Computers C-29, 308-316.
9. COFFMAN, E. G. AND GRAHAM, R. L. 1972. Optimal scheduling for two-processor systems. Acta Informatica 1, 200-213.
10. FINTA, L. AND LIU, Z. 1996. Single machine scheduling subject to precedence delays. Discrete Applied Mathematics 70, 247-266.
11. FREDERICKSON, G. N. 1982. Scheduling unit-time tasks with integer release times and deadlines. Tech. Rep. CS-81-27, Dept. of Computer Science, Penn. State University.
12. GABOW, H. N. AND TARJAN, R. E. 1983. A linear-time algorithm for a special case of disjoint set union. Proc. of ACM Symposium on Theory of Computation, 246-251.
13. GAREY, M. AND JOHNSON, D. 1976. Scheduling tasks with nonuniform deadlines on two processors. Journal of the ACM 23, 3 (July), 461-467.
14. GAREY, M. AND JOHNSON, D. 1977. Two-processor scheduling with start-times and deadlines. SIAM Journal of Computing 6, 3 (Sept.), 416-426.
15. GAREY, M. AND JOHNSON, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company.
16. GIBBONS, P. AND MUCHNICK, S. 1986. Efficient instruction scheduling for pipelined architecture. Proceedings of the ACM Symposium on Compiler Construction, 11-16.
17. GRAHAM, R. L., LAWLER, E. L., LENSTRA, J. K., AND KAN, A. H. G. R. 1979. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5, 287-326.
18. HAN, C. AND LIN, K. 1989. Job scheduling with temporal distance constraints. Tech. Rep. TRUIUCDCS-R-89-1560, University of Illinois.
19. HAN, C. AND LIN, K. 1992. Scheduling real-time computations with separation constraints. Information Processing Letters 42, 61-66.
20. HANK, R. E., HWU, W., AND RAU, B. 1995. Region-based compilation: An introduction and motivation. In Proceedings of the 28th International Workshop on Microprogramming and Microarchitecture. 158-168.
21. HENNESSY, J. AND GROSS, T. 1983. Postpass code optimization of pipeline constraints. ACM Transactions on Programming Languages and Systems 5 (3).
22. HENNESSY, J., JOUPPI, N., GILL, J., BASKETT, F., STRONG, A., GROSS, T., ROWEN, C., AND LEONARD, J. 1982. The MIPS machine. Proceedings IEEE Compcon, 2-7.
23. HU, T. C. 1961. Parallel sequencing and assembly line problems. Operations Research 9, 841-848.
24. HWU, W.-M. W., MAHLKE, S. A., CHEN, W. Y., CHANG, P. P., WARTER, N. J., BRINGMANN, R. A., OUELLETTE, R. G., HANK, R. E., T. KIYOHARA, G. E. H., HOLM, J. G., AND LAVERY, D. M. 1993. The superblock: An effective technique for VLIW and superscalar compilation. The Journal of Supercomputing 7, 229-248.
25. JACKSON, J. R. 1955. Scheduling a production line to minimize maximum tardiness. Tech. Rep. 43, Management Science Research Project, University of California.
26. KATEVENIS, M. 1984. Reduced Instruction Set Computer Architecture for VLSI. MIT Press, Cambridge, Mass.
27. LAM, M. 1988. Software pipelining: An effective scheduling technique for VLIW machines. Proceedings SIGPLAN'88 Symposium on Programming Language Design and Implementation, 318-328.
28. LAWLER, E. L. 1973. Optimal sequencing of a single machine subject to precedence constraints. Management Sci. 19, 544-546.
29. LENSTRA, J. K., KAN, A. H. G. R., AND BRUCKER, P. 1977. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1, 343-362.
30. LEUNG, A., PALEM, K., AND PNUELI, A. 1998. A fast algorithm for scheduling time-constrained instructions on processor with ILP. The International Conference on Parallel Architectures and Compilation Techniques (PACT '98).
31. LEUNG, J. Y.-T., VORNBERGER, O., AND WITHOFF, J. D. 1984. On some variants of the bandwidth minimization problem. SIAM Journal of Computing 13, 3.
32. MOON, S. AND EBCIOGLU, K. 1992. An efficient resource-constrained global scheduling technique for superscalar and VLIW processors. In Proceedings IEEE MICRO-25.
33. PALEM, K. 1986. On the complexity of precedence constrained scheduling. Tech. Rep. TR-86-11, University of Texas, Austin, TX.
34. PALEM, K. AND SIMONS, B. 1993. Scheduling time-critical instructions on RISC machines. ACM Transactions on Programming Languages and Systems 5(3).
35. PAPADIMITRIOU, C. AND YANNAKAKIS, M. 1979. Scheduling interval-ordered tasks. SIAM Journal of Computing 8, 405-409.
36. RADIN, G. 1983. The 801 minicomputer. IBM Journal of Research and Development 27, 3, 237-246.
37. RAU, B. 1994. Iterative modulo scheduling: An algorithm for software pipelining loops. Proceedings of the 27th Annual Symposium on Microarchitecture.
38. RAU, B. R. AND GLASER, C. D. 1981. Scheduling scheduling techniques and an easily schedulable horizontal architecture for high performance scientific computing. Proceedings of the 20th Annual Workshop on Microprogramming and Microarchitecture, 183-198.
39. SIMONS, B. 1983. Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines. SIAM Journal of Computing 12, 294-299.
40. SU, B., DING, S., AND XIA, J. 1987. Microcode compaction with timing constraints. In In Proceedings of the 20th Microprogramming Workshop (MICRO-20). Colorado Springs, Colorado.
41. TARJAN, R. E. 1975. Efficiency of a good but not linear set union algorithm. J. ACM 22, 215-225.
42. ULLMAN, J. D. 1975. NP-complete scheduling problems. Journal of Computer and System Sciences 10, 384-393.
43. WARREN, H. 1990. Instruction scheduling for the IBM RISC system/6k processors. IBM Journal of Research and Development, 85-92.
44. WIJAYA, P. AND ALLAN, V. H. 1989. Incremental foresighted local compaction. In Proceedings of the 22nd annual international workshop on Microprogramming and microarchitecture. Dublin, Ireland.
45. WU, H., YAP, R., AND JAFFAR, J. 1999. Private communication.