skip to main content
article
Free Access

Efficient and exact data dependence analysis

Published:01 May 1991Publication History
First page image

References

  1. 2 R. Allen and K. Kennedy. Automatic translation of FORTRAN programs to vector form. ACM Transactions on Programming Languages and Systems, 9(4):491-542, October 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 3 U. Banerjee. Speedup of Ordinary Programs. PhD thesis, University of Illinois at Urbana-Champaign, October 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 4 U. Banerjee. Dependence Analysis for Supercomputing. Kluwer Academic, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 5 M. Burke and R. Cytron. Interprocedural dependence analysis and parallelization. In Proceedings of the SIGPLAN 1986 Symposium on Compiler Construction, pages 162-175, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 6 G. Dantzig and B. C. Eaves. Fourier-motzkin elimination and its dual. Journal of Combinatorial Theory, A(14):288-297, 1973.Google ScholarGoogle Scholar
  6. 7 M. Berry et al. The PERFECT Club benchmarks: effective performance evaluation of supercomputerso Technical Report UIUCSRD Rep. No. 827, University of Illinois Urbana-Champaign, 1989.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 8 R. Kannan. Minkowski's convex body theorem and integer programming. Mathematics of Operations Research, 12(3):415-440, August 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 9 H.W. Lenstra. Integer programming with a fixed number of variables. Mathematics of Operations Research, 8(4):538-548, 1983.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 10 Z. Li and P. Yew. Practical methods for exact data dependency analysis. In Proceedings of the Second Workshop on Languages and Compilers for Parallel Computing, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 11 Z. Li, P. Yew, and C. Zhu. An efficient data dependence analysis for parallelizing compilers. IEEE Transactions on Parallel and Distributed Systems, 1 (1):26-34, Jan 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 12 V.R. Pratt. Two easy theories whose combination is hard. Technical report, Mass institue of Technology, Sept. 1977.Google ScholarGoogle Scholar
  12. 13 A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 14 Z. Shen, Z. Li, and P. Yew. An empirical study on array subscripts and data dependencies. In Proceedings of 1989 International Conference on Parallel Processing, pages 11-145 to 11-152, 1989.Google ScholarGoogle Scholar
  14. 15 R. Shostak. Deciding linear inequalities by computing loop residues. ACM Journal, 28(4):769-779, Oct 1981. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 16 S. Tjiang, M. Wolf, M.S. Lam, K. Pieper, and J.L. Hennessy. An overview of the SUIF compiler system. 1990.Google ScholarGoogle Scholar
  16. 17 R. Triolet. Interproceclural analysis for program restructuring with parafrase. Technical Report CSRD Rep. No. 538, University of illinois Urbana- Champaign, Dec. 1985.Google ScholarGoogle Scholar
  17. 18 D. R. Wallace. Dependence of multi-dimensional array references. In Proceedings of 1988 International Conference on Parallel Processing, pages 418-428, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 19 M. Wolfe. Optimizing Supercompilers for Supercomputers. The MIT Press, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Efficient and exact data dependence analysis

              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 SIGPLAN Notices
                ACM SIGPLAN Notices  Volume 26, Issue 6
                June 1991
                352 pages
                ISSN:0362-1340
                EISSN:1558-1160
                DOI:10.1145/113446
                Issue’s Table of Contents
                • cover image ACM Conferences
                  PLDI '91: Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
                  May 1991
                  356 pages
                  ISBN:0897914287
                  DOI:10.1145/113445

                Copyright © 1991 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 1 May 1991

                Check for updates

                Qualifiers

                • article

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader