Software Pipelining: An Effective Scheduling Technique for VLIW Machines

ACM SIGPLAN Notices

Volumn 23, Issue 7, 1988, Pages 318-328

  Lam, Monica ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976767736     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/960116.54022     Document Type: Article

References (32)

1. Aiken, A. and Nicolau, A. Perfect Pipelining: A New Loop Parallelization Technique. Cornell University, Oct, 1987.
2. Annaratone, M., Bitz, F., Clune E., Kung H. T., Maulik, P., Ribas, H., Tseng, P., and Webb, J. Applications of Warp. Proc. Compcon Spring 87, San Francisco, Feb., 1987, pp. 272-275.
3. Annaratone, M., Bitz, F., Deutch, J., Hamey, L., Kung, H. T., Maulik P. C., Tseng, P., and Webb, J. A. Applications Experience on Warp. Proc. 1987 National Computer Conference, AFIPS, Chicago, June, 1987, pp. 149-158.
4. Annaratone, M., Amould, E., Gross, T., Kung, H. T., Lam, M., Menzilcioglu, O. and Webb, J. A. "The Warp Computer: Architecture, Implementation and Performance". IEEE Transactions on Computers C-36,12 (December 1987).
5. Colwell, R. P., Nix, R. P., O’Donnell, J. J., Papworth, D. B., and Rodman, P. K., A VLIW Architecture for a Trace Scheduling Compiler. Proc. Second Intl. Conf. on Architectural Support for Programming Languages and Operating Systems, Oct., 1987, pp. 180-192.
6. Dantzig, G. B., Blattner, W. O. and Rao, M. R. All Shortest Routes from a Fixed Origin in a Graph. Theory of Graphs, Rome, July, 1967, pp. 85-90.
7. Ebcioglu, Kemal. A Compilation Technique for Software Pipelining of Loops with Conditional Jumps. Proc. 20th Annual Workshop on Microprogramming, DeC., 1987.
8. Ellis, John R. Bulldog: A Compiler for VUIW Architectures. Ph.D. Th., Yale University, 1985.
9. Fisher, J. A. The Optimization of Horizontal Microcode Within and Beyond Basic Blocks: An Application of Processor Scheduling with Resources. Ph.D. Th., New York Univ., Oct 1979.
10. Fisher, J. A. "Trace Scheduling: A Technique for Global Microcode Compaction". IEEE Trans. on Computers C-30, 7 (July 1981), 478-490.
11. Fisher, J. A., Ellis, J. R., Ruttenberg, J. C. and Nicolau, A. Parallel Processing: A Smart Compiler and a Dumb Machine. Proc. ACM SIGPLAN ’84 Symp. on Compiler Construction, Montreal, Canada, June, 1984, pp. 37-47.
12. Fisher, J. A., Landskov, D. and Shriver, B. D. Microcode Compaction: Looking Backward and Looking Forward. Proc. 1981 National Computer Conference, 1981, pp. 95-102.
13. Floyd, R. W. "Algorithm 97: Shortest Path". Comm. ACM 5, 6 (1962), 345.
14. Garey, Michael R. and Johnson, David S., Computers and Intractability A Guide to the Theory of NP-Completeness. Freeman, 1979.
15. Gross, T. and Lam, M. Compilation for a High-performance Systolic Array. Proc. ACM SIGPLAN 86 Symposium on Compiler Construction, June, 1986, pp. 27-38.
16. Hsu, Peter. Highly Concurrent Scalar Processing. Ph.D. Th., University of Illinois at Urbana-Champaign, 1986.
17. Isoda, Sadahiro, Kobayashi, Yoshizumi, and Ishida, Toru. "Global Compaction of Horizontal Microprograms Based on the Generalized Data Dependency Graph". IEEE Trans. on Computers c-32,10 (October 1983), 922-933.
18. Kuck, D. J., Kuhn, R. H., Padua, D. A., Leasure, B. and Wolfe, M. Dependence Graphs and Compiler Optimizations. Proc. ACM Symposium on Principles of Programming Languages, January, 1981, pp. 207-218.
19. Lah, J. and Atkin, E. Tree Compaction of Microprograms. Proc. 16th Annual Workshop on Microprogramming, Oct, 1982, pp. 23-33.
20. Lam, Monica. Compiler Optimizations for Asynchronous Systolic Array Programs. Proc. Fifteenth Annual ACM Symposium on Principles of Programming Languages, Jan., 1988.
21. Lam, Monica. A Systolic Array Optimizing Compiler. Ph.D. Th., Carnegie Mellon University, May 1987.
22. Linn, Joseph L. SRDAG Compaction - A Generalization of Trace Scheduling to Increase the Use of Global Context Information. Proc. 16th Annual Workshop on Microprogramming, 1983, pp. 11-22.
23. McMahon, F. H. Lawrence Livermore National Laboratory FORTRAN Kernels: MFLOPS.
24. Patel, Janak H. and Davidson, Edward S. Improving the Throughput of a Pipeline by Insertion of Delays. Proc. 3rd Annual Symposium on Computer Architecture, Jan., 1976, pp. 159-164.
25. Rau, B. R. and Glaeser, C. D. Some Scheduling Techniques and an Easily Schedulable Horizontal Architecture for High Performance Scientific Computing. Proc. 14th Annual Workshop on Microprogramming, Oct., 1981, pp. 183-198.
26. Su, B., Ding, S. and Jin, L. An Improvement of Trace Scheduling for Global Microcode Compaction. Proc. 17th Annual Workshop in Microprogramming, Dec., 1984, pp. 78-85.
27. Su, B., Ding, S., Wang, J. and Xia, J. GURPR – A Method for Global Software Pipelining. Proc. 20th Annual Workshop on Microprogramming, DeC., 1987, pp. 88-96.
28. Su, B., Ding, S. and Xia, J. URPR – An Extension of URCR for Software Pipeline. Proc. 19th Annual Workshop on Microprogramming, Oct, 1986, pp. 104-108.
29. Tarjan, R. E. "Depth first search and linear graph algorithms". SIAM J. Computing 1,2 (1972), 146-160.
30. Touzeau, R. F. A Fortran Compiler for the FPS-164 Scientific Computer. Proc. ACM SIGPLAN ’84 Symp. on Compiler Construction, June, 1984, pp. 48-57.
31. Weiss, S. and Smith, J. E. A Study of Scalar Compilation Techniques for Pipelined Supercomputers. Proc. Second Intl. Conf. on Architectural Support for Programming Languages and Operating Systems, Oct., 1987, pp. 105-109.
32. Wood, Graham. Global Optimization of Microprograms Through Modular Control Constructs. Proc. 12th Annual Workshop in Microprogramming, 1979, pp. 1-6.