A fast algorithm for scheduling time-constrained instructions on processors with ILP

Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT

Volumn , Issue , 1998, Pages 158-166

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

^a NEW YORK UNIVERSITY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PARALLEL ARCHITECTURES; PIPELINES; SCHEDULING;

ACKERMANN FUNCTIONS; EMBEDDED APPLICATION; INSTRUCTION LEVEL PARALLELISM; INSTRUCTION SCHEDULING; PERFORMANCE IMPROVEMENTS; PRECEDENCE CONSTRAINTS; THEORETICAL FOUNDATIONS; UNIT EXECUTION TIME;

SCHEDULING ALGORITHMS;

EID: 77952985352     PISSN: 1089795X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PACT.1998.727188     Document Type: Conference Paper

References (22)

1. 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.
2. P. Brucker and S. Knust. Complexity results for singlemachine problems with positive finish-start time-lags. Osnabruecker Schriften zur Mathematik, Reihe P, Nr. 202, 1998.
3. J. Bruno, J. Jones, and K. So. Deterministic scheduling with pipelined processors. IEEE Transactions of Computers, C-29:308-316, Apr. 1980.
4. E. Coffman and R. Graham. Optimal scheduling for twoprocessor systems. Acta Informatica, 1:200-213, 1972.
5. L. Finta and Z. Liu. Single machine scheduling subject to precedence delays. Discrete Applied Mathematics, 70:247-266, 1996.
6. G. N. Frederickson. Scheduling unit-time tasks with integer release times and deadlines. Technical Report CS-81-27, Dept. of Computer Science, Penn. State University, 1982.
7. H. N. Gabow and R. Tarjan. A linear-time algorithm for a special case of disjoint set union. Proc. of ACM Symposium on Theory of Computation, pages 246-251, 1983.
8. M. Garey and D. Johnson. Two-processor scheduling with start-times and deadlines. SIAM Journal of Computing, 6(3):416-426, Sept. 1977.
9. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. R. Kan. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5:287-326, 1979.
10. J. Hennessy and T. Gross. Postpass code optimization of pipeline constraints. ACM Transactions on Programming Languages and Systems, 5(3), 1983.
11. J. Hennessy, N. Jouppi, J. Gill, F. Baskett, A. Strong, T. Gross, C. Rowen, and J. Leonard. The MIPS machine. Proceedings IEEE Compcon, pages 2-7, February 1982.
12. J. R. Jackson. Scheduling a production line to minimize maximum tardiness. Technical Report 43, Management Science Research Project, University of California, 1955.
13. M. Katevenis. Reduced Instruction Set Computer Architecture for VLSI. MIT Press, Cambridge, Mass., 1984.
14. J.-K. Lenstra, D. Shmoys, and E. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Proceedings of the 28th IEEE Conference on Foundation of Computer Science, pages 217-224, 1987.
15. K. Palem. On the complexity of precedence constrained scheduling. Technical Report TR-86-11, University of Texas, Austin, TX, 1986.
16. K. Palem and B. Simons. Scheduling time-critical instructions on RISC machines. ACM Transactions on Programming Languages and Systems, 5(3), 1993.
17. C. Papadimitriou and M. Yannakakis. Scheduling intervalordered tasks. SIAM Journal of Computing, 8:405-409, 1979.
18. G. Radin. The 801 minicomputer. IBM Journal of Research and Development, 27(3):237-246, 1983.
19. A. Schulz. Polytopes and Scheduling. PhD thesis, Fachbereich Mathematik, Technische Universität Berlin, Berlin, Germany, 1996.
20. R. E. Tarjan. Efficiency of a good but not linear set union algorithm. J. ACM, 22:215-225, April 1975.
21. J. D. Ullman. NP-complete scheduling problems. Journal of Computer and System Sciences, 10:384-393, 1975.
22. H. Warren. Instruction scheduling for the IBM RISC system/ 6k processors. IBM Journal of Research and Development, pages 85-92, 1990.