Skip to main content
SpringerLink
Log in

Extending software pipelining techniques for scheduling nested loops

  • Conference paper
  • First Online:
Languages and Compilers for Parallel Computing (LCPC 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 768))

Abstract

In this paper, we extend software pipelining techniques for scheduling nested loops. Under this framework, a periodic scheduling function, called r-periodic schedule, is associated with each operation of the loop body for the entire iteration space. We present a simple problem formulation as well as efficient solutions which give provable, asymptotically time-optimal schedules for nested loops under our program model. It also provides some useful insights on the interplay between unimodular loop transformations and fine-grain scheduling under a unified frame-work.

This work was supported by the EPPP project, financed by Industry Science Canada, Alex Parallel Computers, Digital Equipment Canada, IBM Canada and CRIM (Centre de recherche informatique de Montréal).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aiken. Compaction-based parallelization. (PhD thesis), Technical Report 88-922, Cornell University, 1988.

    Google Scholar 

  2. A. Aiken and A. Nicolau. Optimal loop parallelization. In Proceedings of the 1988 ACM SIGPLAN Conference on Programming Languages Design and Implementation, June 1988.

    Google Scholar 

  3. A. Aiken and A. Nicolau. A realistic resource-constrained software pipelining algorithm. In Proceedings of the Third Workshop on Programming Languages and Compilers for Parallel Computing, Irvine, CA, August 1990.

    Google Scholar 

  4. W. Backes, U. Schwiegelshohn, and L. Thiele. Analysis of free schedule in periodic graphs. In SPAA '92, pages 333–339. ACM, 1992.

    Google Scholar 

  5. U. Banerjee. Unimodular transformations of double loops. In Proceedings of the Third Workshop on Programming Languages and Compilers for Parallel Computing, Irvine, CA, August 1990. Also published in Monographs in Parallel and Distributed Computing, Pages 192–219, Pitman, 1991.

    Google Scholar 

  6. C.J. Brownhill and A. Nicolau. A hierarchical parallelizing compiler for VLIW/MIMD machines. In Proceedings of the 5-th Workshop on Languages and Compilers for Parallel Computing, August 1992.

    Google Scholar 

  7. P.R. Cappello and K. Steiglitz. Unifying VLSI array design with linear transformations of space-time. In F.P. Preparata, editor, Advances in Computing Research, Greenwich, U.K., 1984. JAI Press Inc.

    Google Scholar 

  8. M.C. Chen. Synthesizing systolic designs. In 1985 International Symposium on VLSI Technology, Systems and Applications, 1985.

    Google Scholar 

  9. P. Chretienne. Les réseaux de Petri temporisés. PhD thesis, Thèse d'état, Université P. et M. Curie, 1983.

    Google Scholar 

  10. L. Cooper and D. Steinberg. Introduction to methods of optimization. W.B. Saunders Company, 1970.

    Google Scholar 

  11. A. Darte, L. Khachiyan, and Y. Robert. Linear scheduling is nearly optimal. Parallel Processing Letters, 1(2):pp. 73–81, 1991.

    Article  Google Scholar 

  12. A. Darte, T. Risset, and Y. Robert. Loop nest scheduling and transformations. In Proc. of Environments and Tools for Parallel Scientific Computing, J.J. Dongarra and B. Tourancheau eds., North Holland (1993), July 1992.

    Google Scholar 

  13. A. Darte and Y. Robert. Scheduling uniform loop nests. Rapport 92-10, Laboratoire de l'Informatique du Parallélisme, Ecole Normale Supérieure de Lyon, February 1992.

    Google Scholar 

  14. J.M. Delosme and I.C.F. Ipsen. Efficient systolic arrays for the solution of Toeplitz systems: an illustration of a methodology for the construction of systolic architectures for VLSI. In Systolic Arrays, 1986.

    Google Scholar 

  15. V. Van Dongen, G.R. Gao, and Q. Ning. Extending software pipelining to nested loops. Technical Report Acaps Memo 53, School of Computer Science, McGill University, December 1992.

    Google Scholar 

  16. K. Ebcioglu. A compilation technique for software pipelining of loops with conditional jumps. In Proceedings of the 20th Annual Workshop on Microprogramming, December 1987.

    Google Scholar 

  17. K. Ebcioglu and A. Nicolau. A global resource-constrained parallelization technique. In Proceedings of the ACM SIGARCH International Conference on Supercomputing, June 1989.

    Google Scholar 

  18. P. Feautrier. A collection of papers on the systematic construction of parallel and distributed programs. Technical Report Hors-série, Lab. MASI, Université P. et M. Curie, 4 Place Jussieu 75252 Paris Cédex 05, June 1992.

    Google Scholar 

  19. G. R. Gao, Y. B. Wong, and Qi Ning. A Petri-Net model for fine-grain loop scheduling. In Proceedings of the '91 ACM-SIGPLAN Conference on Programming Language Design and Implementation, pages 204–218, Toronto, Canada, June 1991.

    Google Scholar 

  20. F. Gasperoni and U. Schwiegelshohn. ”Scheduling Loops on Parallel Processors: a Simple Algorithm with Close to Optimum Performance,” Proc. Int. Conf. CONPAR 92, G. Goos and J. Hartmanis Editors, Lecture notes in Computer Science 634, pp. 625–636, Springer Verlag 1992.

    Google Scholar 

  21. H.V. Jagadish, S.K. Rao, and T. Kailath. Array architectures for iterative algorithms. Proceedings of the IEEE, 1987.

    Google Scholar 

  22. B. Joinnault. Conception d'algorithmes et d'architectures systoliques. Thèse de l'Université de Rennes I, Sept 1987.

    Google Scholar 

  23. Monica Lam. Software pipelining: An effective scheduling technique for VLIW machines. In Proceedings of the 1988 ACM SIGPLAN Conference on Programming Languages Design and Implementation, pages 318–328, Atlanta, GA, June 1988.

    Google Scholar 

  24. Eugene L. Lawler. Combinatorial Optimization: Networks and Matroids. Saunders College Publishing, Ft Worth, TX, 1976.

    Google Scholar 

  25. L.S. Liu, C.W. Ho, and J.P. Sheu. On the parallelism of nested for-loops using index shift method. In Proc. of International Conf. on Parallel Processing, pages II-119–II-123, Aug. 1992.

    Google Scholar 

  26. A. Nicolau, K. Pingali, and A. Aiken. Fine-grain compilation for pipelined machines. Technical Report TR-88-934, Department of Computer Science, Cornell University, Ithaca, NY, 1988.

    Google Scholar 

  27. Q. Ning and G.R. Gao. A novel framework of register allocation for software pipelining. In Proceedings of 20th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '93), pages 29–42, Charleston, South Carolina, January 10–13 1993.

    Google Scholar 

  28. Constantine Polychronopoulos. Toward auto-scheduling compilers. Technical report, University of Illinois-CSRD, May 1988. CSRD Rpt. No. 789.

    Google Scholar 

  29. P. Quinton. Automatic synthesis of systolic arrays from uniform recurrent equations. In Proc. IEEE 11-th Int. Sym. on Computer Architecture, 1984.

    Google Scholar 

  30. B. R. Rau and C. D. Glaeser. Some scheduling techniques and an easily schedulable horizontal architecture for high performance scientific computing. In Proceedings of the 14th Annual Workshop on Microprogramming, pages 183–198, 1981.

    Google Scholar 

  31. R. Reiter. Scheduling parallel computations. Journal of ACM, 15:590–599, October 1968.

    Article  Google Scholar 

  32. Y. Robert and S. Song. Revisiting cycle shrinking. Parallel Computing, pages pp. 481–496, 1992.

    Google Scholar 

  33. R. F. Touzeau. A FORTRAN compiler for the FPS-164 scientific computer. In Proceedings of the ACM SIGPLAN '84 Symposium on Compiler Construction, pages 48–57, June 1984.

    Google Scholar 

  34. V. Van Dongen, G. Gao, and Q. Ning. A polynomial time method for optimal software pipelining. In Proceedings of CONPAR '92, Lecture Notes in Computer Science 634, Paris, France, September 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, McGill University, H3A 2A7, Montréal, PQ, Canada

    Guang R. Gao

  2. Centre de recherche informatique de Montréal, H3A 2N4, Montréal, PQ, Canada

    Qi Ning & Vincent van Dongen

Authors
  1. Guang R. Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qi Ning
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vincent van Dongen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Utpal Banerjee David Gelernter Alex Nicolau David Padua

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gao, G.R., Ning, Q., van Dongen, V. (1994). Extending software pipelining techniques for scheduling nested loops. In: Banerjee, U., Gelernter, D., Nicolau, A., Padua, D. (eds) Languages and Compilers for Parallel Computing. LCPC 1993. Lecture Notes in Computer Science, vol 768. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57659-2_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-57659-2_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57659-4

  • Online ISBN: 978-3-540-48308-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation