Article

A unified framework for nonlinear dependence testing and symbolic analysis

Authors:

Robert A. van Engelen,

Kyle A. GallivanAuthors Info & Claims

ICS '04: Proceedings of the 18th annual international conference on Supercomputing

Pages 106 - 115

https://doi.org/10.1145/1006209.1006226

Published: 26 June 2004 Publication History

Abstract

This paper presents a unified approach for generalized induction variable recognition and substitution, pointer analysis, analysis of conditionally updated variables, value range analysis, array region analysis, and nonlinear dependence testing. The analysis techniques share a well-defined uniform approach based on the chains of recurrences algebra. The uniform algebraic approach provides a powerful unified framework for developing analysis algorithms for restructuring compilers. The paper introduces a new set of analysis algorithms that accurately handle conditional control flow, pointer arithmetic, and nonlinear symbolic expressions in loops, which are known to be problematic for conventional restructuring compilers.

References

[1]

AHO, A., SETHI, R., AND ULLMAN, J. Compilers: Principles, Techniques and Tools. Addison-Wesley Publishing Company, Reading MA, 1985.]]

Digital Library

[2]

ALEFELD, G. Interval arithmetic tools for range approximation and inclusion of zeros. In Error Control and Adaptivity in Scientific Computing, H. Bulgak and C. Zenger, Eds. Kluwer Academic Publishers, 1999, pp. 1--21.]]

[3]

ALLEN, F., COCKE, J., AND KENNEDY, K. Reduction of operator strength. In Program Flow Analysis (New-Jersey, 1981), S. Muchnick and N. Jones, Eds., Prentice-Hall, pp. 79--101.]]

[4]

ALLEN, R., AND JOHNSON, S. Compiling C for vectorization, parallelization, and inline expansion. In Proc. of the SIGPLAN 1988 Conference of Programming Languages Design and Implementation (Atlanta, GA, June 1988), pp. 241--249.]]

Digital Library

[5]

AMMERGUALLAT, Z., AND HARRISON III, W. Automatic recognition of induction variables and recurrence relations by abstract interpretation. In Proc. of the ACM SIGPLAN'90 Conf. on Programming Language Design and Implementation (White Plains, NY, 1990), pp. 283--295.]]

Digital Library

[6]

BACHMANN, O. Chains of Recurrences. PhD thesis, Kent State University, College of Arts and Sciences, 1996.]]

Digital Library

[7]

BACHMANN, O., WANG, P., AND ZIMA, E. Chains of recurrences - a method to expedite the evaluation of closed-form functions. In International Symposium on Symbolic and Algebraic Computing (Oxford, 1994), ACM, pp. 242--249.]]

Digital Library

[8]

BANERJEE, U. Dependence Analysis for Supercomputing. Kluwer, Boston, 1988.]]

Digital Library

[9]

BASU, A., LEUPERS, R., AND MARWEDEL, P. Array index allocation under register constraints in DSP programs. In 12th Int. Conf. on VLSI Design (Goa, India, 1999).]]

Digital Library

[10]

BLUME, AND EIGENMANN. Nonlinear and symbolic data dependence testing. IEEE Transactions on Parallel and Distributed Systems 9, 12 (December 1998), 1180--1194.]]

Digital Library

[11]

BLUME, W., AND EIGENMANN, R. The range test: a dependence test for symbolic non-linear expressions. In Supercomputing (1994), pp. 528--537.]]

Digital Library

[12]

BLUME, W., AND EIGENMANN, R. Demand-driven, symbolic range propagation. In 8th International workshop on Languages and Compilers for Parallel Computing (Columbus, Ohio, USA, Aug. 1995), pp. 141--160.]]

Digital Library

[13]

BLUME, W., AND EIGENMANN, R. Symbolic range propagation. In Proceedings of the 9th International Parallel Processing Symposium (April 1995), pp. 357--363.]]

Digital Library

[14]

BURKE, M., AND CYTRON, R. Interprocedural dependence analysis and parallelization. In Symposium of Compiler Construction (1986), pp. 162--175.]]

Digital Library

[15]

CINTRA, M., AND ARAUJO, G. Array reference allocation using SSA-form and live range growth. In Proc. of the ACM SIGPLAN 2000 LCTES (Vancouver, June 2000), pp. 26--33.]]

Digital Library

[16]

COLLARD, J.-F., BARTHOU, D., AND FEAUTRIER, P. Fuzzy array dataflow analysis. In In proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming (1995), pp. 92--101.]]

Digital Library

[17]

DANTZIG, G. B., AND EAVES, B. C. Fourier-motzkin elimination and its dual. Journal of Combinatorial Theory 14, 14 (1973), 288--297.]]

[18]

DAVIDSON, W., AND JINTURKAR, S. Memory access coalescing: A technique for eliminating redundant memory accesses. In proceedings of the SIGPLAN'94 Symposium on Programming Language Design and Implementation (1994), pp. 186--195.]]

Digital Library

[19]

DUESTERWALD, E., GUPTA, R., AND SOFFA, M. A practical data flow framework for array reference analysis and its use in optimizations. In Proc. of the SIGPLAN Conference on Programming Languages Design and Implementation (Albuquerque, New Mexico, 1993), pp. 67--77.]]

Digital Library

[20]

EIGENMANN, R., HOEFLINGER, J., JAXON, G., LI, Z., AND PADUA, D. Restructuring Fortran programs for Cedar. In Proc. of ICPP'91 (St. Charles, Illinois, 1991), vol. 1, pp. 57--66.]]

[21]

EIGENMANN, R., HOEFLINGER, J., LI, Z., AND PADUA, D. Experience in the automatic parallelization of four perfect-benchmark programs. In 4th Annual Workshop on Languages and Compilers for Parallel Computing, LNCS 589 (Santa Clara, CA, 1991), Springer Verlag, pp. 65--83.]]

Digital Library

[22]

EUROPEAN TELECOMMUNICATION STANDARD (ETSI). Digital cellular telecommunications system: ANSI-C code for the GSM enhanced full rate (EFR) speech codec. Available from http://www.etsi.org.]]

[23]

FAHRINGER, T. Efficient symbolic analysis for parallelizing compilers and performance estimators. Supercomputing 12, 3 (May 1998), 227--252.]]

Digital Library

[24]

FAHRINGER, T., AND SCHOLZ, B. Symbolic evaluation for parallelizing compilers. In 11th ACM International Conference on Supercomputing (New York, 1997), ACM Press, pp. 261--268.]]

Digital Library

[25]

FAHRINGER, T., AND STOLZ, B. A unified symbolic evaluation framework for parallelizing compilers. IEEE Transactions on Parallel and Distributed Systems 11, 11 (Nov. 2000).]]

Digital Library

[26]

FRANKE, B., AND O'BOYLE, M. Compiler transformation of pointers to explicit array accesses in DSP applications. In Proc. of the ETAPS Conf. on Compiler Construction 2001, LNCS 2027 (2001), pp. 69--85.]]

Digital Library

[27]

GERLEK, M., STOLZ, E., AND WOLFE, M. Beyond induction variables: Detecting and classifying sequences using a demand-driven SSA form. ACM Transactions on Programming Languages and Systems (TOPLAS) 17, 1 (Jan. 1995), 85--122.]]

Digital Library

[28]

GOFF, G., KENNEDY, K., AND TSENG, C.-W. Practical dependence testing. In Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation (Toronto, Ontario, Canada, June 1991), vol. 26, pp. 15--29.]]

Digital Library

[29]

HAGHIGHAT, M., AND POLYCHRONOPOULOS, C. Symbolic program analysis and optimization for parallelizing compilers. In 5th Annual Workshop on Languages and Compilers for Parallel Computing, LNCS 757 (New Haven, Connecticut, 1992), Springer Verlag, pp. 538--562.]]

Digital Library

[30]

HAGHIGHAT, M. R. Symbolic Analysis for Parallelizing Compilers. Kluwer Academic Publishers, 1995.]]

Digital Library

[31]

HAGHIGHAT, M. R., AND POLYCHRONOPOULOS, C. D. Symbolic analysis for parallelizing compilers. ACM Transactions on Programming Languages and Systems 18, 4 (July 1996), 477--518.]]

Digital Library

[32]

HAVLAK, P. Interprocedural Symbolic Analysis. PhD thesis, Dept. of Computer Science, Rice University, 1994.]]

Digital Library

[33]

HAVLAK, P., AND KENNEDY, K. Experience with interprocedural analysis of array side effects. Supercomputing (1990), 952--961.]]

Digital Library

[34]

J. GU, Z. L., AND LEE, G. Experience with efficient array data flow analysis for array privatization. In Sixth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (June 1997), pp. 157--167.]]

Digital Library

[35]

KONG, X., KLAPPHOLZ, D., AND PSARRIS, K. The I Test: An improved dependence test for automatic parallelization and vectorization. IEEE Transactions on Parallel and Distributed Systems 2, 3 (1991), 342--349.]]

Digital Library

[36]

KUCK, D. The Structure of Computers and Computations, vol. 1. John Wiley and Sons, New York, 1987.]]

Digital Library

[37]

MATEEV, N., MENON, V., AND PINGALI, K. Fractal symbolic analysis. In proceedings of the International Conference on Supercomputing (ICS) (2001), pp. 38--49.]]

Digital Library

[38]

MAYDAN, D. E., HENNESSY, J. L., AND LAM, M. S. Efficient and exact data dependence analysis. In Proceedings of the Conference on Programming Language Design and Implementation (1991), ACM Press, pp. 1--14.]]

Digital Library

[39]

MUCHNICK, S. Advanced Compiler Design and Implementation. Morgan Kaufmann, San Fransisco, CA, 1997.]]

Digital Library

[40]

POLYCHRONOPOULOS, C. Parallel Programming and Compilers. Kluwer, Boston, 1988.]]

Digital Library

[41]

PSARRIS, K. Program analysis techniques for transforming programs for parallel systems. Parallel Computing 28, 3 (2003), 455--469.]]

Digital Library

[42]

PSARRIS, K., KONG, X., AND KLAPPHOLZ, D. The direction vector I Test. IEEE Transactions on Parallel and Distributed Systems 4, 11 (November 1993), 1280--1290.]]

Digital Library

[43]

PSARRIS, K., AND KYRIAKOPOULOS, K. Measuring the accuracy and efficiency of the data dependence tests. In International Conference on Parallel and Distributed Computing Systems (2001).]]

[44]

PSARRIS, K., AND KYRIAKOPOULOS, K. The impact of data dependence analysis on compilation and program parallelization. In International Conference on Supercomputing (2003).]]

Digital Library

[45]

PUGH, W. The omega test: a fast and practical integer programming algorithm for dependence analysis. In Supercomputing (1991), pp. 4--13.]]

Digital Library

[46]

PUGH, W. Counting solutions to Presburger formulas: How and why. In ACM SIGPLAN Conference on Programming Language Design and Implementation (Orlando, FL, June 1994), pp. 121--134.]]

Digital Library

[47]

PUGH, W., AND WONNACOTT, D. Nonlinear array dependence analysis. In In 3rd Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers (1994).]]

[48]

RUGINA, R., AND RINARD, M. Symbolic bounds analysis of array indices, and accessed memory regions. In SIGPLAN Conference on Programming Language Design and Implementation (Vancouver, British Columbia, Canada, June 2000), pp. 182--195.]]

Digital Library

[49]

SHEN, Z., LI, Z., AND YEW, P.-C. An empirical study on array subscripts and data dependencies. In International Conference on Parallel Processing (1989), vol. 2, pp. 145--152.]]

[50]

SU, E., LAIN, A., RAMASWAMY, S., PALERMO, D., HODGES, E., AND BANERJEE, P. Advanced compilation techniques in the PARADIGM compiler for distributed-memory multicomputers. In 9th ACM International Conference on Supercomputing (Barcelona, Spain, July 1995), ACM Press, pp. 424--433.]]

Digital Library

[51]

TU, P., AND PADUA, D. Gated SSA-based demand-driven symbolic analysis for parallelizing compilers. In 9th ACM International Conference on Supercomputing (New York, July 1995), ACM Press, pp. 414--423.]]

Digital Library

[52]

VAN ENGELEN, R. Symbolic evaluation of chains of recurrences for loop optimization. Tech. rep., TR-000102, Computer Science Dept., Florida State University, 2000.]]

[53]

VAN ENGELEN, R., GALLIVAN, K., AND WALSH, B. Tight timing estimation with the Newton-Gregory formulae. In proceedings of CPC 2003 (Amsterdam, Netherlands, January 2003), pp. 321--330.]]

[54]

VAN ENGELEN, R. A. Efficient symbolic analysis for optimizing compilers. In Proc. of the ETAPS Conference on Compiler Construction 2001, LNCS 2027 (2001), pp. 118--132.]]

Digital Library

[55]

VAN ENGELEN, R. A., AND GALLIVAN, K. An efficient algorithm for pointer-to-array access conversion for compiling and optimizing DSP applications. In International Workshop on Innovative Architectures for Future Generation High-Performance Processors and Systems (IWIA) 2001 (Maui, Hawaii, 2001), pp. 80--89.]]

Digital Library

[56]

WOLFE, M. Beyond induction variables. In ACM SIGPLAN'92 Conf. on Programming Language Design and Implementation (San Fransisco, CA, 1992), pp. 162--174.]]

Digital Library

[57]

WOLFE, M. High Performance Compilers for Parallel Computers. Addison-Wesley, Redwood City, CA, 1996.]]

Digital Library

[58]

WOLFE, M., AND TSENG, C.-W. The power test for data dependence. IEEE Transactions on Parallel and Distributed Systems 3, 5 (1992), 591--601.]]

Digital Library

[59]

WU, P., COHEN, A., HOEFLINGER, J., AND PADUA, D. Monotonic evolution: An alternative to induction variable substitution for dependence analysis. In proceedings of the International Conference on Supercomputing (ICS) (2001), pp. 78--91.]]

Digital Library

[60]

YU, T. Z., CHEN, F., AND SHA, E. H.-M. Loop scheduling algorithms for power reduction. In Proc. of the IEEE International Conference on Acoustics, Speech, and Signal Processing (Seattle, Washington, May 1998).]]

[61]

ZIMA, E. Recurrent relations and speed-up of computations using computer algebra systems. In Proc. of DISCO'92 (1992), LNCS 721, pp. 152--161.]]

Digital Library

[62]

ZIMA, E. Simplification and optimization transformations of chains of recurrences. In Proc. of the International Symposium on Symbolic and Algebraic Computing (Montreal, Canada, 1995), ACM.]]

Digital Library

[63]

ZIMA, E. V. Automatic construction of systems of recurrence relations. USSR Computational Mathematics and Mathematical Physics 24, 11-12 (1986), 193--197.]]

Digital Library

[64]

ZIMA, H., AND CHAPMAN, B. Supercompilers for Parallel and Vector Computers. ACM Press, New York, 1990.]]

Cited By

Szafarczyk RNabi SVanderbauwhede WPutnam ALi J(2025)Dynamic Loop Fusion in High-Level SynthesisProceedings of the 2025 ACM/SIGDA International Symposium on Field Programmable Gate Arrays10.1145/3706628.3708871(211-222)Online publication date: 27-Feb-2025
https://dl.acm.org/doi/10.1145/3706628.3708871
Essertel GWei GRompf T(2019)Precise reasoning with structured time, structured heaps, and collective operationsProceedings of the ACM on Programming Languages10.1145/33605833:OOPSLA(1-30)Online publication date: 10-Oct-2019
https://dl.acm.org/doi/10.1145/3360583
Chikin ALloyd TAmaral JTiotto EUsman M(2019)Memory-access-aware Safety and Profitability Analysis for Transformation of Accelerator-bound OpenMP LoopsACM Transactions on Architecture and Code Optimization10.1145/333306016:3(1-26)Online publication date: 18-Jul-2019
https://dl.acm.org/doi/10.1145/3333060
Show More Cited By

Index Terms

A unified framework for nonlinear dependence testing and symbolic analysis
1. Software and its engineering
  1. Software notations and tools
    1. Compilers

Recommendations

Nonlinear and Symbolic Data Dependence Testing

One of the most crucial qualities of an optimizing compiler is its ability to detect when different data references access the same storage location. Such references are said to be data-dependent and they impose constraints on the amount of program ...
Instance-wise points-to analysis for loop-based dependence testing
ICS '02: Proceedings of the 16th international conference on Supercomputing

We present a points-to analysis that aims at enabling loop-based dependence analysis in the presence of Java references. The analysis is based on an abstraction called element-wise points-to (ewpt) mapping. An ewpt mapping summarizes, in a compact ...
A communication placement framework with unified dependence and data-flow analysis
HIPC '96: Proceedings of the Third International Conference on High-Performance Computing (HiPC '96)

Communication placement analysis is an important step in the compilation of data-parallel programs for multiprocessor systems. This paper presents a communication placement framework that minimizes frequency of communication, eliminates redundant ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICS '04: Proceedings of the 18th annual international conference on Supercomputing

June 2004

360 pages

ISBN:1581138393

DOI:10.1145/1006209

General Chair:
Paul Feautrier
LIP, ENS Lyon
,
Program Chairs:
James Goodman
University of Auckland
,
André Seznec
IRISA, INRIA

Copyright © 2004 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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 June 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tag

compiler

Qualifiers

Article

Conference

ICS04

Sponsor:

ICS04: International Conference on Supercomputing 2004

June 26 - July 1, 2004

Malo, France

Acceptance Rates

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

30
Total Citations
View Citations
635
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Szafarczyk RNabi SVanderbauwhede WPutnam ALi J(2025)Dynamic Loop Fusion in High-Level SynthesisProceedings of the 2025 ACM/SIGDA International Symposium on Field Programmable Gate Arrays10.1145/3706628.3708871(211-222)Online publication date: 27-Feb-2025
https://dl.acm.org/doi/10.1145/3706628.3708871
Essertel GWei GRompf T(2019)Precise reasoning with structured time, structured heaps, and collective operationsProceedings of the ACM on Programming Languages10.1145/33605833:OOPSLA(1-30)Online publication date: 10-Oct-2019
https://dl.acm.org/doi/10.1145/3360583
Chikin ALloyd TAmaral JTiotto EUsman M(2019)Memory-access-aware Safety and Profitability Analysis for Transformation of Accelerator-bound OpenMP LoopsACM Transactions on Architecture and Code Optimization10.1145/333306016:3(1-26)Online publication date: 18-Jul-2019
https://dl.acm.org/doi/10.1145/3333060
Sundararajah KKulkarni MMcKinley KFisher K(2019)Composable, sound transformations of nested recursion and loopsProceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3314221.3314592(902-917)Online publication date: 8-Jun-2019
https://dl.acm.org/doi/10.1145/3314221.3314592
Maalej MPaisante VMagno Quinto Pereira FGonnord L(2018)Combining range and inequality information for pointer disambiguationScience of Computer Programming10.1016/j.scico.2017.10.014152:C(161-184)Online publication date: 15-Jan-2018
https://dl.acm.org/doi/10.1016/j.scico.2017.10.014
Zhao JZhao R(2018)K-DTThe Journal of Supercomputing10.1007/s11227-017-2187-374:4(1655-1675)Online publication date: 1-Apr-2018
https://dl.acm.org/doi/10.1007/s11227-017-2187-3
Niedzielski DPsarris KTheoharis T(2018)An Analytical Evaluation of Data Dependence Analysis TechniquesInternational Journal of Parallel Programming10.1007/s10766-018-0577-7Online publication date: 18-May-2018
https://doi.org/10.1007/s10766-018-0577-7
Maalej MPaisante VRamos PGonnord LPereira FReddi VSmith ATang L(2017)Pointer disambiguation via strict inequalitiesProceedings of the 2017 International Symposium on Code Generation and Optimization10.5555/3049832.3049848(134-147)Online publication date: 4-Feb-2017
https://dl.acm.org/doi/10.5555/3049832.3049848
Maalej MPaisante VRamos PGonnord LPereira F(2017)Pointer disambiguation via strict inequalities2017 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)10.1109/CGO.2017.7863735(134-147)Online publication date: Feb-2017
https://doi.org/10.1109/CGO.2017.7863735
Weijiang YBalakrishna SLiu JKulkarni M(2015)Tree dependence analysisACM SIGPLAN Notices10.1145/2813885.273797250:6(314-325)Online publication date: 3-Jun-2015
https://dl.acm.org/doi/10.1145/2813885.2737972
Show More Cited By

View Options

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten