Optimal software pipelining under resource constraints

International Journal of Foundations of Computer Science

Volumn 12, Issue 6, 2001, Pages 697-718

  Fimmel, Dirk ^a   Müller, Jan ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

automatic parallelization; heterogeneous architecture; integer linear programming; loop scheduling; resource constraints; Software pipelining

Indexed keywords

EID: 1642264217     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054101000825     Document Type: Article

References (36)

1. A. Aiken, A. Nicolau, and S. Novack. Resource-constrained software pipelining. IEEE Transactions on Parallel and Distributed Systems, 6(12), December 1995.
2. V.H. Allan, R.B. Jones, R.M. Lee, and S.J. Allan. Software pipelining. ACM Computing Surveys, 27(3):367-432, September 1995.
3. E.R. Altman. Optimal Software Pipelining with Function Unit and Register Constraints. PhD thesis, McGill University, Montreal, Quebec, Canada, October 1995.
4. E.R. Altman, R. Govindarajan, and G.R. Gao. Scheduling and mapping: software pipelining in the presence of structural hazards. A CM SIGPLAN Notices: Conference on Programming Language Design and Implementation PLDI, 30(6):139-150, June 1995.
5. A. Bachmann, M. Schobinger, and L. Thiele. Synthesis of domain specific multiprocessor systems including memory design. In Int. Workshop on VLSI and Signal Processing, pages 417-425, 1993.
6. P.-Y. Calland, A. Darte, and Y. Robert. Circuit retiming applied to decomposed software pipelining. IEEE Transactions on Parallel and Distributed Systems, 9(1): 24-35, 1998.
7. A.E. Eichenberger and E.S. Davidson. Efficient formulation for optimal modulo schedulers. In ACM SIGPLAN'97 Conference on Programming Language Design and Implementation PLDI, pages 194-205, Las Vegas, Nevada, June 1997.
8. A.E. Eichenberger, E.S. Davidson, and S.G. Abraham. Minimizing register requirements of a modulo schedule via optimum stage scheduling. International Journal of Parallel Programming, 24(2):103-132, April 1996.
9. C. Eisenbeis, S. Lelait, and B. Marmol. The meeting graph: a new framework for loop register allocation. Technical Report RR-2758, INRIA, Institut National de Recherche en Informatique et en Automatique, 1995.
10. C. Eisenbeis and A. Sawaya. Optimal loop parallelization under register constraints. Technical Report RR-2781, INRIA, Institut National de Recherche en Informatique et en Automatique, 1996.
11. P. Feautrier. Dataflow analysis of scalar and array references. International Journal of Parallel Programming, 20(l):23-53, February 1991.
12. P. Feautrier. Fine-grain scheduling under resource constraints. In Proc. 7th Int. Workshop on Languages and Compilers for Parallel Computing, Lecture Notes in Computer Science, pages 1-15, Ithaca, New York, 1994. Springer-Verlag.
13. A. Fettweis. Wave digital filters: Theory and practice. Proc. of the IEEE, 74: 270-327, 1986.
14. D. Fimmel and J. Miiller. Optimal software pipelining under register constraints. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications PDPTA, volume V, pages 2607-2613, June 2000.
15. F. Gasperoni and U. Schwiegelshohn. Generating close to optimum loop schedules on parallel processors. Parallel Processing Letters, 4(4):391-403, 1994.
16. C.H. Gebotys. VLSI Design Methodologies for Digital Signal Processing Architectures, chapter Synthesizing Optimal Application-Specific DSP Architectures, pages 43-92. Kluwer Academic Publishers, Boston/Dordrecht/London, M.A. Bayoumi edition, 1994.
17. R. Govindarajan, E.R. Altman, and G.R. Gao. A framework for resourceconstrained rate-optimal software pipelining. In CONPAR/VAPP, Linz, Austria, 1994.
18. R. Govindarajan, E.R. Altman, and G.R. Gao. Minimizing register requirements under resource-constrained rate-optimal software pipelining. In Proceedings of the 27th Annual International Symposium on Microarchitecture, pages 85-94, San Jose, California, November 30-December 2, 1994. ACM SIGMICRO and IEEE Computer Society TC-MICRO.
19. C.-T. Hwang, J.^H. Lee, and Y.-C. Hsu. A formal approach to the scheduling problem in high-level synthesis. IEEE Trans, on Computer-Aided Design, 10(4):464-474, 1991.
20. M.S. Lam. Software pipelining; an effective scheduling technique for VLIW machines. In SIGPLAN'88 Conference on Programming Languages, Design and Implementation PLDI, pages 318-328, Atlanta, GA, USA, 1988.
21. D.M. Lavery and W.W. Hwu. Unrolling-based optimizations for modulo scheduling. In Proceedings of the 28th annual international symposium on Microarchitecture, page 327-337, 1995.
22. C.E. Leiserson and J.B. Saxe. Retiming synchronous circuitry. Algorithmica, 6:5-35, 1991.
23. S. Lelait, G.R. Gao, and C. Eisenbeis. A new fast algorithm for optimal register allocation in modulo scheduled loops. Research Report 3337, INRIA, Rocquencourt, January 1998.
24. Q. Ning and G.R. Gao. A novel framework of register allocation for software pipelining. In Proceedings of the 20th Annual Symposium on Principles of Programming Languages POPL93, pages 29-42, Charleston, SC, USA, 1993.
25. P. Quinton. Automata Networks in Computer Science, chapter The Systematic Design of Systolic Arrays, pages 229-260. Manchester University Press, 1987.
26. B.A. Rau and J.A. Fisher. Instruction-level parallel processing: History, overview and perspective. Journal of Supercomputing, 7(l):9-50, 1993.
27. B.R. Rau and C.D. Glaeser. Some scheduling techniques and an easily schedulable horizontal architecture for high performance scientific computing. In Proc. of the 14th Annual Workshop of Microprogramming, pages 183-198, 1981.
28. A. Schrijver. Theory of Integer and Linear Programming. John Wiley &Sons, New York, 1986.
29. M. Schwiegershausen, M. Schonfeld, and P. Pirsch. Mapping complex image processing algorithms onto heterogenous multiprocessors regarding architecture dependent performance parameters. In Proc. Int. Workshop of Algorithms and Parallel VLSI Architectures III, pages 353-364, 1994.
30. V.H. van Dongen, R.G. Gao, and Q. Ning. A polynomial time method for optimal software pipelining. Lecture Notes in Computer Science, 634:613-624, 1992.
31. S.R. Vegdahl. A dynamic-programming technique for compacting loops. In Proceedings of the 25th Annual International Symposium on Microarchitecture, Portland, Oregon, USA, pages 180-188, December 1-4 1992.
32. C.-Y. Wang and K.K. Parhi. Resource-constrained loop list scheduler for DSP algorithms. Journal of VLSI Signal Processing, 11:75-96, 1995.
33. J. Wang and C. Eisenbeis. Decomposed software pipelining. In Proceedings of IFP WG 10.3 Working Conference on Architectures and Compilation Techniques, pages 3-15, January 1993.
34. J. Wang, C. Eisenbeis, M. Jourdan, and B. Su. Decomposed software pipelining: A new perspective and a new approach. International Journal of Parallel Programming, 22(3):357-379, 1994.
35. J. Wang, A. Krall, and M.A. Ertl. Decomposed software pipelining with reduced register requirement. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques PACT'95, pages 70-75. IFIP, June 1995.
36. J. Wang, A. Krall, and M.A. Ertl. Register requirement for exploiting loops' maximum instruction-level parallelism. In Proceedings of the 4rd International Conference for Young Computer Scientists, pages 277-280, Beijing, China, July 1995.