skip to main content
article
Free Access

Code generation schema for modulo scheduled loops

Published:10 December 1992Publication History
First page image

References

  1. 1 (Special issue on IBM RISC System/6000 processor). IBM Journal of Research and Development 34, i (i990).Google ScholarGoogle Scholar
  2. 2 Allen, J.R., Kennedy, K., Porterfield, C., and Warren, J. Conversion of control dependence to data dependence. In Proceedings of Tenth Annual ACM Symposium of Principles of Programming languages, (1983). Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Butler, M., et al. Single instruction stream parallelism is greater than two. In Proceedings of Eighteenth Annual International Symposium on Computer Architecture, (Toronto, 1991). Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 Char!esworth, A.E. An approach to scientific array processing: the architectural design of the AP-120B/FPS-164 family. IEEE Computer 14, 9 (1981), 18-27.Google ScholarGoogle Scholar
  5. 5 Dehnert, J.C., Hsu, P.Y.-T., and Bratt, J.P. Overlapped loop support in the Cydra 5. In Proceedings of the Third International Conference on Architectural Support for Program tm'ng~guages and Operating Systems, (Boston, Mass., 1989), 26-38. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 Ebcioglu, K., and Nakatanl, T. A new compilation technique for Raralle!!zi.ng loops with unpredictable branches on a v 14 w arcmtecmre, m canguages and Compilers for Parallel Computing, Gelernter, D., Nicolau, A., and Padua, D., Editor. 1989, Pitman/The MIT Press: London. p. 213-229. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Fisher, J.A. Trace scheduling: a technique for global microcode compaction. IEEE Transactions on Computers C- 30, 7 (1981).Google ScholarGoogle Scholar
  8. 8 Foster, C.C., and Riseman, E.M. Percolation of code to enhance parallel dispatching and execution. IEEE Transactions on Computers C-21, 12 (1972), 1411-1415.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 Hsu, P.Y.-T. Highly Concurrent Scalar Processing. Coordinated Science Lab. Technical Report CSG-49. University of Illinois, 1986.Google ScholarGoogle Scholar
  10. 10 Jain, S. Circular scheduling: a new technique to perform software pipelining,m' rroceeamgs oj ~ne ~c. ln olurt~,~v ~I Conference on Programming Language Design and Implementation, (1991), 219-228. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 Dam, M. Software pipelining; an effective scheduling technique for VLIW machines. In Proceedings of the ACM SIGPLAN '88 Conference on Programming Language Design and_ !mp!en~ntation; (!988), 3!8-327: Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12 Lee, R.L., Kwok, A.Y., and Briggs, F.A. The floating point performance of a superscalar SPARC processor. In Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, (Santa Clara, California, 1991), 28-37. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13 Mahlke, S.A., et al. Sentinel scheduling for VLIW and superscaiar processors, in Proceedings of the The Fifth international Conference on Architectural Support for Programming Languages and Operating Systems, (Boston, IVIaSSaC, IIU$St~LI~, 1 ~,~,). Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14 Nicolau, A., and Fisher, J.A. Measuring the parallelism available for very long instruction word architectures. IEEE Transactions on Comp,ters C-33. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15 Nicolau, A., and Potasman, R. Realistic scheduling: compaction for pipelined axchitecmres. In Proceedings of the 23th Ann_u.a! Workshop on Microprogramming and Microarchitecture, (Orlando, Florida, 1990), 69-79. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16 Rau, B.R., and Glaeser, C.D. Some scheduling techniques and an easily schedulahle horizontal architecture for high performance scientific computing. In Proceedings of the Fourteenth Annual Workshop on Microprogramming, (1981), 183-198. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17 Rau, B.R., Lee, M., Tirumalai, P., and Schlansker, M.S. Register allocation for software pipelined loops. In Proceedings of the SIGPLAN'92 Conference on Programming Language Design and implementation, (San Francisco, 1992). Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18 Rau, B.R., Schlansker, M.S., and Tirumalai, P.P. Code generation schemas for modulo scheduled DO-loops and Laboratories, 1992.Google ScholarGoogle Scholar
  19. 19 Rau, B.R., Yen, D.W.L., Yen, W., and Towle, R.A. The Cydra s; departmental mpercomputer: design nhiln.~cmhles~ decisions and trade-offs. IEEE Computer 22, i (1989). Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 20 Riseman, E.M., and Foster, C.C. The inhibition of potential parallelism by conditional jumps, iEEE Transactions on Computers C-21, 12 (1972), 1405-1411.Google ScholarGoogle Scholar
  21. 21 Su, B., and Wang, J. GURPR*: a new global software pipelining algorithm. In Proceedings of the 24th Annual International Symposium on Microarchitecture, (Albuquerque, New Mexico, 1991), 212-216. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 22 Tirumalai, P., Lee, M., and Schlansker, M.S. Parallelizatioa of loops with exits on pipeiined architectures, in Proceedings of the Supercomputing '90, (1990), 200-212. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. 23 Tjaden, G.S., and Flynn, M.J. Detection and parallel execution OI pigasiel iu~tructlun~, tg~,f-, Transactions on Computers C-19 10 (1970), 889-895.Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. 24 Touzeau, R.F. A FORTRAN compiler for the FPS-164 Scientific computer. In proceedings of the ACM SIGPLAN'84 Symposium on Compiler Construction, (1984), 48-57. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. 25 Wall, D.W. Limits of instruction-level parallelism. In Prncn~.dln~,s nf the Fourth International Conference on ~4rchite-ctu~al-Support-for'-Programming Languages and Operating Systems, (1991), 176-188. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Code generation schema for modulo scheduled loops

                Recommendations

                Comments

                Login options

                Check if you have access through your login credentials or your institution to get full access on this article.

                Sign in

                Full Access

                • Published in

                  cover image ACM SIGMICRO Newsletter
                  ACM SIGMICRO Newsletter  Volume 23, Issue 1-2
                  Dec. 1992
                  300 pages
                  ISSN:1050-916X
                  DOI:10.1145/144965
                  Issue’s Table of Contents
                  • cover image ACM Conferences
                    MICRO 25: Proceedings of the 25th annual international symposium on Microarchitecture
                    December 1992
                    301 pages
                    ISBN:0818631759

                  Copyright © 1992 Authors

                  Publisher

                  Association for Computing Machinery

                  New York, NY, United States

                  Publication History

                  • Published: 10 December 1992

                  Check for updates

                  Qualifiers

                  • article

                PDF Format

                View or Download as a PDF file.

                PDF

                eReader

                View online with eReader.

                eReader
                About Cookies On This Site

                We use cookies to ensure that we give you the best experience on our website.

                Learn more

                Got it!