Parametric computation of margins and of minimum cumulative register lifetime dates

1. E. R. Altman “Optimal Software Pipelining with Function Unit and Register Constraints” Ph.D. thesis, ACAPS laboratory, McGill university, Montreal, Oct. 1995.

   Google Scholar 

2. R. K. Ahuja, T. L. Magnanti, J. B. Orlin “Network Flows” Optimization, G. L. Nemhauser, A. H. G. Rinnooy Kan, M. J. Todd editors, North-Holland 1989.

   Google Scholar 

3. A. Ali, R. Helgason, J. Kennington, H. Lall “Primal Simplex Network Codes: State-of-the-Art Implementation Technology” Networks, vol. 8, pp. 315–339, 1978.

   Google Scholar 

4. J. C. Dehnert, R. A. Towle “Compiling for Cydra 5” Journal of Supercomputing, vol. 7, pp. 181–227, May 1993.

   Article  Google Scholar 

5. B. Dupont de Dinechin “An Introduction to Simplex Scheduling” PACT'94, Montreal, Aug. 1994.

   Google Scholar 

6. B. Dupont de Dinechin “Simplex Scheduling: More than Lifetime-Sensitive Instruction Scheduling” PRISM research report 1994.22, available under anonymous ftp from ftp.prism.uvsq.fr, July 94.

   Google Scholar 

7. B. Dupont de Dinechin “Insertion Scheduling: An Alternative to List Scheduling for Modulo Schedulers”, Proceedings of 8th international workshop on Language and Compilers for Parallel Computers, LNCS #1033, Columbus, Ohio, Aug. 1995.

   Google Scholar 

8. B. Dupont de Dinechin “A Unified Software Pipeline Construction Scheme for Modulo Scheduled Loops”, PRISM research report 1996.xx, ftp://ftp.prism.uvsq.fr, Nov. 1996.

   Google Scholar 

9. D. Goldfarb, J. Hao, S-R. Kai “Shortest Path Algorithms Using Dynamic Breadth-First Search” Networks, vol. 21, pp. 29–50, 1991.

   Google Scholar 

10. R. A. Huff “Lifetime-Sensitive Modulo Scheduling” Proceedings of the SIG-PLAN'93 Conference on Programming Language Design and Implementation, Albuquerque, June 1993.

    Google Scholar 

11. R. M. Karp, J. B. Orlin “Parametric Shortest Path Algorithms with an Application to Cyclic Staffing” Discrete Applied Mathematics, vol. 3, pp. 37–45, 1981.

    Article  Google Scholar 

12. M. Lam “Software Pipelining: An Effective Scheduling Technique for VLIW Machines” Proceedings of the SIGPLAN'88 Conference on Programming Language Design and Implementation, 1988.

    Google Scholar 

13. J. Llosa, M. Valero, E. Ayguade, A. Gonzalez “Hypernode Reduction Modulo Scheduling” Proceedings of the IEEE / ACM Annual Symposium on Microarchitecture / MICRO-28, 1995.

    Google Scholar 

14. Q. Ning “Re: Question about the POPL paper”, private communication, Feb. 1996.

    Google Scholar 

15. Q. Ning, G. R. Gao “A Novel Framework of Register Allocation for Software Pipelining” Proceedings of the ACM SIGPLAN'93 Symposium on Principles of Programming Languages, Jan. 1993.

    Google Scholar 

16. B. R. Rau, C. D. Glaeser “Some Scheduling Techniques and an Easily Schedulable Horizontal Architecture for High Performance Scientific Computing” IEEE / ACM 14th Annual Microprogramming Workshop, Oct. 1981.

    Google Scholar 

17. B. R. Rau “Iterative Modulo Scheduling: An Algorithm for Software Pipelining Loops” IEEE / ACM 27th Annual Microprogramming Workshop, San Jose, California, Nov. 1994.

    Google Scholar 

18. J. Ruttenberg, G. R. Gao, A. Stoutchinin, W. Lichtenstein “Software Pipelining Showdown: Optimal vs. Heuristic Methods in a Production Compiler” Proceedings of the SIGPLAN'96 Conference on Programming Language Design and Implementation, Philadelphia, May 1996.

    Google Scholar 

19. R. E. Tarjan “Data Structures and Network Algorithms” CBMS-NSF Regional Conference Series in Applied Mathematics, no. 44, 1983.

    Google Scholar 

20. J. C. Tiernan “An Efficient Search Algorithm to Find the Elementary Circuits of a Graph” Communications of the ACM, vol. 13, no. 12, Dec. 1970.

    Google Scholar 

21. N. E. Young, R. E. Tarjan, J. B. Orlin “Faster Parametric Shortest Path and Minimum-Balance Algorithms” Networks, vol. 21, pp. 205–221, 1991.

    Google Scholar 

Download references