Skip to main content
SpringerLink
Log in

Data dependence and data-flow analysis of arrays

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

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

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. U. Banerjee. Dependence Analysis for Supercomputing. Kluwer Academic, 1988.

    Google Scholar 

  2. T. Brandes. The importance of direct dependences for automatic parallelism. In Proceedings of 1988 International Conference on Supercomputing, 1988.

    Google Scholar 

  3. 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 Scholar 

  4. P. Feautrier. Array expansion. In International Conference on Supercomputing, pages 429–442, 1988.

    Google Scholar 

  5. P. Feautrier. Parametric integer programming. Technical Report 209, Laboratoire Methodologie and Architecture Des Systemes Informatiques, Jan 1988.

    Google Scholar 

  6. P. Feautrier. Dataflow analysis of array and scalar references. International Journal of Parallel Programming, 20(1):23–52, Feb 1991.

    Google Scholar 

  7. G. Goff, K. Kennedy, and C. Tseng. Practical dependence testing. In Proceedings of the SIGPLAN 1991 PLDI, pages 15–29, 1991.

    Google Scholar 

  8. E.D. Granston and A.V. Veidenbaum. Detecting redundant accesses to array data. In Supercomputing '91, pages 854–865, 1991.

    Google Scholar 

  9. T. Gross and P. Steenkiste. Structured dataflow analysis for arrays and its use in an optimizing compiler. Software —Practice and Experience, 20(2): 133–155, 1990.

    Google Scholar 

  10. D. E. Maydan. Accurate Analysis of Array References. PhD thesis, Stanford University, Sept 1992.

    Google Scholar 

  11. D.E. Maydan, S. P. Amarasinghe, and M.S. Lam. Array data-flow analysis and its use in array privatization. In Proceedings of the SIGPLAN 1993 POPL, 1993.

    Google Scholar 

  12. W. Pugh and D. Wonnacott. Eliminating false data dependences using the omega test. In Proceedings of the SIGPLAN 1992 PLDI, pages 140–151, 1992.

    Google Scholar 

  13. H. Ribas. Obtaining dependence vectors for nested-loop computations. In Proceedings of 1990 International Conference on Parallel Processing, 1990.

    Google Scholar 

  14. C. Rosend. Incremental Dependence Analysis. PhD thesis, Rice University, March 1990.

    Google Scholar 

  15. A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Stanford University, Stanford, California

    D. Maydan, S. Amarsinghe & M. Lam

Authors
  1. D. Maydan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Amarsinghe
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Lam
    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

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maydan, D., Amarsinghe, S., Lam, M. (1993). Data dependence and data-flow analysis of arrays. In: Banerjee, U., Gelernter, D., Nicolau, A., Padua, D. (eds) Languages and Compilers for Parallel Computing. LCPC 1992. Lecture Notes in Computer Science, vol 757. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57502-2_63

Download citation

  • DOI: https://doi.org/10.1007/3-540-57502-2_63

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57502-3

  • Online ISBN: 978-3-540-48201-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation