Robert A. van Engelen, Johnnie Birch, Kyle A. Gallivan  Home/Search
Context
Related
| fsu.edu/~engelen/IWIApaper.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: fsu.edu/~engelen/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents a new approach to dependence testing in the presence of nonlinear and non-closed array index expressions and pointer references. The chains of recurrences formalism and algebra is used to analyze the recurrence relations of induction variables, and for constructing recurrence forms of array index expressions and pointer references. We use these recurrence forms to determine if the array and pointer references are free of dependences in a loop nest. Our recurrence formulation ... (Update)
Active bibliography (related documents): More All
2.9: Value Range Analysis of Conditionally Updated Variables .. - Birch, van Engelen.. (2004) (Correct)
0.9: The CR# Algebra and its Application in Loop Analysis and.. - van Engelen (2004) (Correct)
0.8: An Efficient Algorithm for Pointer-to-Array Access.. - van Engelen, Gallivan (2001) (Correct)
Similar documents based on text:
0.2: Dependence Testing without Induction Variable Substitution - Cohen, Wu (Correct)
0.1: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ engelen-array,
author = "Robert A. van Engelen and Johnnie Birch and Kyle A. Gallivan",
title = "Array Data Dependence Testing with the Chains of Recurrences Algebra",
url = "citeseer.ist.psu.edu/vanengelen04array.html" }
Citations (may not include all citations):866 Techniques and Tools (context) - AHO, SETHI et al. - 1985
352 Supercompilers for Parallel and Vector Computers (context) - ZIMA, CHAPMAN - 1990
299 Dependence Analysis for Supercomputing (context) - BANERJEE - 1988
292 Advanced Compiler Design and Implementation (context) - MUCHNICK - 1997
110 Practical dependence testing - GOFF, KENNEDY et al. - 1991
104 The Structure of Computers and Computations (context) - KUCK - 1987
84 Efficient and exact data dependence analysis (context) - MAYDAN, HENNESSY et al. - 1991
79 Interprocedural dependence analysis and parallelization (context) - BURKE, CYTRON - 1986
68 Beyond induction variables: Detecting and classifying sequen.. - GERLEK, STOLZ et al. - 1995
58 Counting solutions to Presburger formulas: How and why - PUGH - 1994
54 Fuzzy array dataflow analysis - COLLARD, BARTHOU et al. - 1995
45 Gated SSA-based demand-driven symbolic analysis for parallel.. - TU, PADUA - 1995
42 Symbolic Analysis for Parallelizing Compilers - HAGHIGHAT - 1995
42 symbolic range propagation - BLUME, EIGENMANN - 1995
40 Interprocedural Symbolic Analysis - HAVLAK - 1994
34 Advanced compilation techniques in the PARADIGM compiler for.. - SU, LAIN et al. - 1995
26 ACM Transactions on Programming Languages and Systems (context) - HAGHIGHAT, POLYCHRONOPOULOS - 1996
26 Parallel Programming and Compilers (context) - POLYCHRONOPOULOS - 1988
26 Chains of recurrences - a method to expedite the evaluation .. - BACHMANN, WANG et al. - 1994
20 An empirical study on array subscripts and data dependencies (context) - SHEN, LI et al. - 1989
17 High Performance Compilers for Parallel Computers (context) - WOLFE - 1996
17 Experience with interprocedural analysis of array side effec.. (context) - HAVLAK, KENNEDY
15 Efficient symbolic analysis for parallelizing compilers and .. - FAHRINGER - 1998
13 Simplification and optimization transformations of chains of.. - ZIMA - 1995
12 Recurrent relations and speed-up of computations using compu.. (context) - ZIMA - 1992
10 Automatic construction of systems of recurrence relations (context) - ZIMA - 1986
7 Monotonic evolution: An alternative to induction variable su.. - WU, COHEN et al. - 2001
7 Symbolic evaluation of chains of recurrences for loop optimi.. - VAN ENGELEN - 2000
6 An efficient algorithm for pointer-to-array access conversio.. - VAN ENGELEN, GALLIVAN - 2001
6 A unified framework for nonlinear dependence testing and sym.. (context) - VAN ENGELEN, BIRCH et al. - 2004
5 Efficient symbolic analysis for optimizing compilers - VAN ENGELEN - 2001
4 Compiler transformation of pointers to explicit array access.. - FRANKE, O'BOYLE - 2001
3 Program analysis techniques for transforming programs for pa.. (context) - PSARRIS - 2003
3 Tight timing estimation with the Newton-Gregory formulae - VAN ENGELEN, GALLIVAN et al. - 2003
3 College of Arts and Sciences (context) - BACHMANN - 1996
2 The impact of data dependence analysis on compilation and pr.. (context) - PSARRIS, KYRIAKOPOULOS - 2003
2 Measuring the accuracy and efficiency of the data dependence.. (context) - PSARRIS, KYRIAKOPOULOS - 2001
2 Value range analysis of conditionally updated variables and .. - BIRCH, VAN ENGELEN et al. - 2004
1 An experimental evaluation of data dependence analysis techn.. (context) - PSARRIS, KYRIAKOPOULOS - 2004
1 Symbolic bounds analysis of array indices (context) - RUGINA, RINARD - 2000
Documents on the same site (http://www.cs.fsu.edu/~engelen/): More
XML-RPC Agents for Distributed Scientific Computing - van Engelen, Gallivan.. (2000) (Correct)
Symbolic Evaluation of Chains of Recurrences for Loop Optimization - van Engelen (2000) (Correct)
Automatic Validation of Code-Improving Transformations - van Engelen, Whalley, Yuan (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC