Software pipelining showdown: Optimal vs. heuristic methods in a production compiler

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 31, Issue 5, 1996, Pages 1-11

  Ruttenberg, John ^a   Gao, G R ^b   Stoutchinin, A ^b   Lichtenstein, W ^a  

^a HEWLETT PACKARD ENTERPRISE   (United States)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17144391554     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/249069.231385     Document Type: Article

References (30)

1. A. Aiken and A. Nicolau. Optimal loop parallelizations. In Proc. of the '88 SIGPLAN Conf. on Programming Language Design and Implementation, pp. 308-317, Atlanta, Georgia, June 1988.
2. J. R. Allen, K. Kennedy, C. Porterfield, and J. Warren. Conversion of control dependence to data dependence. In Proc. of the 10th Ann. ACM Symp. on Principles of Programming Languages, pp. 177-189, January 1983.
3. E. R. Altman, R. Givindarajan, and G.R. Gao. Scheduling and mapping: Software pipelining in the presence of structural hazards. In Proc. of 95 SIGPLAN Conf. on Programming Language Design and Implementation, La Jolla, Calif., June 1995.
4. E. R. Altman. Optimal Software Pipelining with Functional Unit and Register Constraints. Ph.D. thesis, McGill University, Montreal, Quebec, 1995.
5. R. Bixby, K. Kennedy, and U. Kremer. Automatic data layout using 0-1 integer linear programming. In Proc. of Conf. on Parallel Architectures and Compilation Techniques, pp. 111-122, August 1994.
6. P. Briggs, K.D. Cooper, K. Kennedy, and L. Torczon. Coloring heuristics for register allocation. In Proc. of '89 SIGPLAN Conf. on Programming Language Design and Implementation, pp. 275-284, July 1989.
7. P. Briggs. Register Allocation via Graph Coloring. Ph.D. thesis, Rice University, Houston, Texas, April 1992.
8. J.C. Dehnert and R.A. Towle. Compiling for Cydra 5. Journal of Supercomputing, v.7, pp.181-227, May 1993.
9. A. E. Eichenberger, E. S. Davidson, and S. G. Abraham. Optimum modulo schedules for minimum register requirements. In Proc. of '95 Intl. Conf. on Supercomputing, pp. 31-40, Barcelona, Spain, July 1995.
10. P. Feautrier. Fine-grained scheduling under resource constraints. In 7th Ann. Workshop on Languages and Compilers for Parallel Computing, Ithaca, N. Y., August 1994.
11. G. R. Gao and Q. Ning. Loop storage optimization for dataflow machines. In Proc. of 4th Ann. Workshop on Languages and Compilers for Parallel Computing, pp. 359-373, August 1991.
12. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guideto the Theory of NP-Completeness. W.H. Freeman and Co., New York, N.Y., 1979.
13. F. Gasperoni and U. Schwiegelshohn. Efficient algorithms for cyclic scheduling. Res. Prep. RC17068, IBM TJ Watson Res. Center, Yorktown Heights, N.Y., 1991.
14. R. Govindarajan, E. R. Altman, and G. R. Gao. A framework for rate-optimal resource-constrained software pipelining. In Proc. of CONPAR94-VAPP VI, no. 854, Lecture Notes in Computer Science, pp. 640-651, Linz, Austria, September 1994.
15. R. Govindarajan, E. R. Altman, and G. R. Gao. Minimizing register requirements under resource-constrained rate-optimal software pipelining. In Proc. of the 27th Ann. Intl. Symp. on Microarchitecture, pp. 85-94, San Jose, Calif., November-December 1994.
16. Hsu, P., Designing the TFP Microprocessor, IEEE Micro, April 1994, pp. 23-33.
17. R. A. Huff. Lifetime-sensitive modulo scheduling. In Proc. of the '93 SIGPLAN Conf. on Programming Language Design and Implementation, pp. 258-267, Albuquerque, N. Mex., June 1993.
18. M. Lam. Software pipelining: An effective scheduling technique for VLIW machines. In Proc. of the ' 88 SIGPLAN Conf. on Programming Lanugage Design and Implementation, pp. 318-328, Atlanta, Georgia, June 1988.
19. M. Lam. A systolic array optimizing compiler. Kluwer Academic Publishers, 1989.
20. S. Moon and K. Ebcioglu. An efficient resource-constrained global scheduling technique for superscalar and VLIW processors. In Proc. of the 25th Ann. Intl. Symp. on Microarchitecture, pp. 55-71, Portland, Ore., December 1992.
21. G. Nemhauser and L. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, 1988.
22. G. Nemhauser. The age of optimization: Solving large-scale real-world problems. Operations Research, 42(1):5-13, January-February 1994.
23. Q. Ning and G. Gao. Optimal loop storage allocation for argument-fetching dataflow machines. International Journal of Parallel Programming, v. 21, no. 6, December 1992.
24. Q. Ning and G. Gao. A novel framework of register allocation for software pipelining. In Conf. Rec. of the 20th Ann. ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, pp. 29-42, Charleston, S. Carolina, January 1993.
25. W. Pugh. The Omega test: A fast and practical integer programming algorithm for dependence analysis. In Proc. Supercomputing '91, pp. 18-22, November 1991.
26. B. R. Rau and C. D. Glaser. Some scheduling tecniques and an easily schedulable horizontal architecture for high performance scientific computing. In Proc. of the 14 Ann. Microprogramming Workshop, pp. 183-198, Chatham, Mass., October 1981.
27. B. R. Rau and J.A. Fisher. Instruction-level parallel processing: History, overview and perspective. Journal of Supercomputing, v.7, pp.:9-50, May 1993.
28. B.R. Rau. Iterative modulo scheduling: An algorithm for software pipelining loops. In Proc. of the 27th Ann. Intl. Symp. on Microarchitecture, pp. 63-74, San Jose, Calif., November-December 1994.
29. R.F. Touzeau. A FORTRAN compiler for the FPS-164 scientific computer. In Proceedings of the SIGPLAN '84 Symposium on Compiler Construction, pages 48-57, Montreal, Quebec, June 17-22, 1984.
30. N.J. Warter, John W. Bockhaus, Grant E. Haab, and K. Supraliminal. Enhanced modulo scheduling for loops with conditional branches. In Proc. of the 25th Ann. Intl. Symp. on Microarchitecture, pp. 170-179, Portland, Ore., December 1992.