Nothing Special   »   [go: up one dir, main page]

Skip to main content

The I+ Test

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

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

  • 274 Accesses

Abstract

The I test is an efficient and precise data dependence method to ascertain whether integer solutions exist for one-dimensional arrays with constant bounds. For one-dimensional arrays with variable limits, the I test assumes that there may exist integer solutions. In this paper, we propose the I+ test—an extended version of the I test. The I+ test can be applied towards determining whether integer solutions exist for one dimensional arrays with either variable or constant limits, improving the applicable range of the I test. Experiments with benchmark cited from EISPACK, LINPACK, Parallel loops, Livermore loops and Vector loops showed that among 1189 pairs of one-dimensional arrays tested, 183 had their data dependence analysis amended by the I+ test. That is, the I+ test increases the success rate of the I test by approximately 15.4 percent. Comparing with the Power test and the Omega test, the I+ test has higher accuracy than the Power test and shares the same accuracy with the Omega test when determining integer solutions for these 1189 pairs of one-dimensional arrays, but has much better effciency over them.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. U. Banerjee. Dependence Analysis for Supercomputing. Kluwer Academic Publishers, Norwell, MA, 1988.

    Google Scholar 

  2. W. Blume and R. Eigenmann. Performance analysis of parallelizing compilers on the perfect benchmark S© programs. IEEE Transactions on Parallel and Distributed Systems, 3(6):643–656, 1992.

    Article  Google Scholar 

  3. W. Blume and R. Eigenmann. The range test: a dependence test for symbolic, nonlinear expressions. In IEEE Supercomputing, pages 528–537, Washington, D.C., 1994.

    Google Scholar 

  4. D. Callahan, J. Dongarra, and D. Levine. Test suite for vectorizing compilers. Technical report, Argonne National Laboratory, Apr. 1991.

    Google Scholar 

  5. R. Dongar. Test suite for parallel compilers. Technical report, Dec. 1991.

    Google Scholar 

  6. X. Kong, D. Klappholz, and K. Psarris. The i test. IEEE Transactions on Parallel and Distributed Systems, 2(3):342–349, 1991.

    Article  Google Scholar 

  7. J. Levesque and J. Williamson. A Guidebook to Fortran on Supercomputing. Academic Press, New York, NY, 1989.

    Google Scholar 

  8. W. Pugh. A practical algorithm for exact array dependence analysis. Communication of the ACM, 35(8):102–114, 1992.

    Article  Google Scholar 

  9. Z. Shen, Z. Li, and P.-C. Yew. An empirical study of Fortran programs for parallelizing compilers. IEEE Transactions on Parallel and Distributed Systems, 1(3):356–364, 1992.

    Article  Google Scholar 

  10. B. Smith et al. Matrix Eigensystem Routines-Eispack Guidge. Springer, 1976.

    Google Scholar 

  11. R. Triolet, F. Irigoin, and P. Feautrier. Direct parallelization of call statements. In Proceedings of SIGPLAN Symposium on Compiler Construction, pages 176–185, Palo Alto, CA, July 1986.

    Google Scholar 

  12. M. Wolfe. High Performance Compilers for Parallel Computing. Addison-Wesley Publishing Company, Reading, MA, 1996.

    MATH  Google Scholar 

  13. M. Wolfe and C.-W. Tseng. The power test for data dependence. IEEE Transactions on Parallel and Distributed Systems, 3(5):591–601, 1992.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chang, WL., Chu, CP. (1999). The I+ Test. In: Chatterjee, S., et al. Languages and Compilers for Parallel Computing. LCPC 1998. Lecture Notes in Computer Science, vol 1656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48319-5_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-48319-5_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66426-0

  • Online ISBN: 978-3-540-48319-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics