See this document in CiteSeerX!

Simplifying Polynomial Constraints Over Integers to Make Dependence Analysis More Precise (1994)  (Make Corrections)  (18 citations)
Vadim Maslov, William Pugh



  Home/Search   Context   Related

 
View or download:
umd.edu/pub/papers/...CSTR3109.1.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  umd.edu/TRs/TRnoabs (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Why do existing parallelizing compilers and environments fail to parallelize many realistic FORTRAN programs? One of the reasons is that these programs contain a number of linearized array references, such as A(M*N*i+N*j+k) or A(i*(i+1)/2+j). Performing exact dependence analysis for these references requires testing polynomial constraints for integer solutions. Most existing dependence analysis systems, however, restrict themselves to solving affine constraints only, so they have to make... (Update)

Context of citations to this paper:   More

...computations are not yet known. But some directions for further investigations are given in the conclusion. Some close work is done in [13], where the authors propose a method to simplify polynomial constraints over integers. It consists in trying to transform the polynomial...

...contradictions, equalities and redundant constraints can be detected and eliminated. Simplifying a set of constraints has been shown [11, 14, 17] to be critical in order to alleviate performance as well as compiler analysis. We have implemented the following simplification...

Cited by:   More
Efficient Symbolic Analysis for Parallelizing Compilers and.. - Fahringer (1998)   (Correct)
Rewrite and Decision Procedure Laboratory: Combining.. - Armando, Compagna..   (Correct)
A Symbolic Approach to Bernstein Expansion for Program.. - Clauss, Tchoupaeva (2004)   (Correct)

Similar documents (at the sentence level):
57.3%:   Simplifying Polynomial Constraints Over Integers to Make.. - Vadim Maslov William (1994)   (Correct)

Active bibliography (related documents):   More   All
0.1:   Static Analysis of Upper and Lower Bounds on Dependences and.. - Pugh, Wonnacott (1994)   (Correct)
0.1:   Interprocedural Symbolic Analysis - Havlak (1994)   (Correct)
0.1:   Lazy Array Data-Flow Dependence Analysis - Maslov (1994)   (Correct)

Similar documents based on text:   More   All
0.2:   Finding Concurrency Bugs in Java - Hovemeyer, Pugh (2004)   (Correct)

Related documents from co-citation:   More   All
7:   Fuzzy array dataflow analysis - Barthou, Collard et al. - 1997
5:   The Omega Test: A Fast and Practical Integer Programming Algorithm for Dependenc.. - Pugh - 1991
4:   Interprocedural Symbolic Analysis - Havlak - 1994

BibTeX entry:   (Update)

Vadim Maslov and William Pugh. Simplifying polynomial constraints over integers to make dependence analysis more precise. Technical Report CS-TR-3109.01, Dept. of Computer Science, University of Maryland, College Park, February 1994. Submitted to CONPAR '94. http://citeseer.ist.psu.edu/maslov94simplifying.html   More

@techreport{ vadim94simplifying,
    author = "Maslov, Vadim and Pugh, William",
    title = "{S}implifying {P}olynomial {C}onstraints {O}ver {I}ntegers to {M}ake {D}ependence {A}nalysis {M}ore {P}recise",
    number = "CS-TR-3109.1",
    month = "Feb",
    year = "94",
    url = "citeseer.ist.psu.edu/maslov94simplifying.html" }
Citations (may not include all citations):
258   Automatic translation of Fortran programs to vector form - Allen, Kennedy - 1987
167   Grobner bases: an algorithmic method in polynomial ideal the.. (context) - Buchberger - 1985
48   A framework for unifying reordering transformations - Kelly, Pugh - 1993
45   Symbolic dependence analysis for high-performance paralleliz.. (context) - Haghighat, Polychronopoulos - 1991
30   Elimination methods: an introduction (context) - Kapur, Lakshman - 1992
28   Going beyond integer programming with the Omega test to elim.. - Pugh, Wonnacott - 1992
24   Delinearization: an efficient way to break multiloop depende.. - Maslov - 1992
17   An evaluation of exact methods for analysis of value-based a.. (context) - Pugh, Wonnacott - 1993
16   Symbolic analysis: A basis for parallelization (context) - Haghighat, Polychronopoulos - 1993
13   Systems and Algorithms for Algebraic Computation (context) - Davenport, Siret et al. - 1988



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.umd.edu/TRs/TR-no-abs.html):   More
Iterative Methods For Stabilized Discrete Convection-Diffusion.. - Shih, Elman (1998)   (Correct)
Perturbation Theory for the Singular Value Decomposition - Stewart (1990)   (Correct)
Adaptive Runtime Support for Direct Simulation Monte Carlo.. - Moon, Saltz (1994)   (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