Skip to main content
SpringerLink
Log in

Interactive and symbolic data dependence analysis based on ranges of expressions

  • Correspondence
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Traditional data dependence testing algorithms have become very accurate and efficient for simple subscript expressions, but they cannot handle symbolic expressions because of the complexity of data-flow and lack of the semantic information of variables in programs. In this paper, a range-based testing and query approach, called DDTQ, is proposed to eliminate data dependence between array references with symbolic subscripts. DDTQ firstly extracts data dependence information from the symbolic subscripts, a testing algorithm is then used to disprove the dependence based on the ranges of expressions. The assumed dependence that cannot be handled by the disprover will be converted into simple questions by a question engine so that the compiler can solve them by user interaction in a friendly way. The experiment on perfect benchmarks indicates that DDTQ is effective in improving the parallelizing capability of the compiler.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Utpal Banerjee. Dependence Analysis for Supercomputing. Kluwe, Boston, MA., 1988.

    Google Scholar 

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

    Article  Google Scholar 

  3. William Pugh. The Omega test: A fast and practical integer programming algorithm for dependence analysis.Supercomputing, 1991, 91: 4–13.

    Google Scholar 

  4. Michael Wolfe, Utpal Banerjee. Data dependence and its application to parallel processing.International Journal of Parallel Programming, 1987, 16(2): 137–178.

    Article  MATH  MathSciNet  Google Scholar 

  5. Bill Pottenger, Rudolf Eigenmann. Parallelization in the presence of generalized induction and reduction variables. Technical Report. 1396, Center for Supercomputing Research and Development University of Illinois at Urbana-Champaign, 1996.

  6. Blume W, Eigenmann R. Nonlinear and symbolic data dependence testing.IEEE Transactions on Parallel and Distributed Systems, Dec, 1998, 9(12): 1180–1194.

    Article  Google Scholar 

  7. Vadim Maslov. Delinearization: An efficient way to break multiloop dependence equations. InProceedings of the SIGPLAN’92 Conference on Programming Language Design and Implementation, 1992, pp.152–161.

  8. Mohammad Haghighat, Comstantine Polychronopoulos. Symbolic Dependence Analysis for High-Performance Parallelizing Compilers. Parallel and Distributed Computing: Advances in Languages and Compilers for Parallel Processing, MIT Press, Cambridge, MA, 1991, pp.310–330.

    Google Scholar 

  9. Chen Wenguang, Yang Bo, Wang Ziyao, Zheng Fengzhou, Zheng Weimin. An interactive FORTRANN 77 parallelizing system.Journal of Software, 1999, 10(12): 1259–1267.

    Google Scholar 

  10. Leggett P F, Marsh A T J, Johnson S P, Cross M. Integrating user knowledge with information from parallelization tools to facilitate the automatic generation of efficient parallel FORTRAN code.Parallel Computing, 1996, 22: 259–288.

    Article  MATH  Google Scholar 

  11. Kennedy K, McKinley K S, Tseng C W. Interactive parallel programming using the ParaScope editor.IEEE Transactions on Parallel and Distributed Systems, 1991, 2(3): 329–341.

    Article  Google Scholar 

  12. Chapman B, Mehrotra P, Zima H. Programming in Vienna FORTRAN.Scientific Programming, 1992, 1(1): 31–50.

    Google Scholar 

  13. Applied Parallel Research Placerbille, CA, FORGE 90 distributed memory parallelizer: User’s guide, version 8.0 edition, 1992.

  14. Havlak P. Interprocedural symbolic analysis [dissertation]. Dept. of Computer Science, Rice University, May, 1994.

  15. William Blume, Rudolf Eigenmann. Demand-driven, symbolic range propagation. Technical Report 1429, Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, 1996,

  16. Berry M, Chen Det al. The perfect club benchmarks: Effective performance evaluation of supercomputers.Int. J. Supercomputer Applications, 1989, 3(3): 5–40.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Tsinghua University, 100084, Beijing, P. R. China

    Yang Bo, Zheng Fengzhou, Wang Dingxing & Zheng Weimin

Authors
  1. Yang Bo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zheng Fengzhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wang Dingxing
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zheng Weimin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yang Bo.

Additional information

Supported by the National Natural Science Foundation (No.69933020, No.69873023) and the NKBRSF (No.G1999032702) of China.

YANG Bo received his BS degree in computer science from Tsinghua University in 1997. Now he is a Ph.D. candidate in the Department of Computer Science, Tsinghua University. His research interests cover parallelizing compiler, network computing and Java for high performance computing.

ZHENG Fengzhou received his BS and MS degrees in computer science from Tsinghua University in 1998 and 2000 respectively. He is now a Ph.D. cadidate in Computer Science Department of Princeton University. His research areas include compiler optimization and Java Programming language.

WANG Dingxing is a professor of computer science at Tsinghua University. His research areas focus on parallel processing, distributed system and network computing.

ZHENG Weimin is a professor of computer science at Tsinghua University. He works in the areas of parallel processing and distributed system.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yang, B., Zheng, F., Wang, D. et al. Interactive and symbolic data dependence analysis based on ranges of expressions. J. Comput. Sci. & Technol. 17, 160–171 (2002). https://doi.org/10.1007/BF02962208

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02962208

Keywords

Search

Navigation