## Detection of Recurrences in Sequential Programs with Loops (1993)

Venue: | In PARLE 93, Springer LNCS |

Citations: | 12 - 0 self |

### BibTeX

@INPROCEEDINGS{Redon93detectionof,

author = {Xavier Redon and Paul Feautrier},

title = {Detection of Recurrences in Sequential Programs with Loops},

booktitle = {In PARLE 93, Springer LNCS},

year = {1993},

pages = {132--145}

}

### OpenURL

### Abstract

. To improve the performances of parallelizing compilers, one must detect recurrences in scientific programs and subject them to special parallelization methods. We present a method for detecting recurrences which is based on the analysis of Systems of Recurrence Equations. This method identifies recurrences on arrays, recurrences of arbitrary order and multi-equations recurrences. We explain how to associate a SRE to a restricted class of imperative programs. We present a normalization of such SRE that allows the detection of recurrences by simple inspection of equations. When detected, a recurrence may be replaced by a symbolic expression of its solution. To iterate the process can lead to the identification of multi-dimensional recurrences. 1 Introduction One of the most important challenges in present day computer science is the efficient compilation of programs for the newly emerging massively parallel architectures. In contrast of the situation for the last generation of superco...

### Citations

160 | Scans as primitive parallel operations
- Blelloch
- 1989
(Show Context)
Citation Context ...Recurrence Operators Some other recurrence operators already exist, namely the reduction operator in the Alpha language (see [6]) and the scan primitives also known as parallel prefix operations (see =-=[3]-=-). However we have introduced our own recurrence operator for the following motives. The Alpha operator is an operator on un-ordered set of values, which is thus restricted to reduction by associative... |

96 |
Analysis of programs for parallel processing
- Bernstein
- 1966
(Show Context)
Citation Context ... the final result of the program. This kind of commutativity property may have two origins. The first one depends only on the pattern of use of memory cells. It is subsumed by Bernstein's conditions (=-=[2]), an-=-d has been extensively exploited by present day parallelizing compilers. The second kind depends on algebraic properties of the operators which appears in the computation. The name "semantic para... |

96 |
Data analysis of scalar and array references
- Feautrier
- 1991
(Show Context)
Citation Context ...w). Moreover we are able to normalize SLRE with a powerful tool: the forward substitution. 3.2 The Dataflow Graph In order to translate the source program into SLRE, we use the algorithm described in =-=[4]-=- for computing the Dataflow Graph (DFG) of the source program. The DFG deals with operations. An operation is a pair build with an instruction and an occurrence of the iteration vector of the instruct... |

47 | A Note on Chernikova’s algorithm
- Verge
- 1992
(Show Context)
Citation Context ...use an algorithm for computing its vertices, like Chernikova's algorithm. We would like to thank H. Le Verge and D. Wilde for allowing us to use the particular implementation they developed at IRISA (=-=[7]-=-). Due to the effectiveness of this algorithm the final systems (after recurrences detection) have a reasonable size (less than ten clauses per equations for small examples). Moreover the final system... |

38 | Program Optimization and Parallelization Using Idioms
- Pinter, Pinter
- 1991
(Show Context)
Citation Context ...e method. In the interest of conciseness, most proofs have been omitted. They may be found in full in [10]. 2 State of the Art Some papers on reductions detection have already been published ([5] and =-=[9]-=-). The first presents a method based on symbolic stores and the last a method based on the dependence graph. 1 some commercial compilers will recognize this form as an idiom and compile it efficiently... |

23 |
un langage equationnel pour la conception et la programmation d'architectures paralleles synchrones
- Alpha
- 1989
(Show Context)
Citation Context ...oint). 3.3 Representation for SLRE Our detection is based on SLRE, thus we must give a precise definition of such systems and find out a way to represent them. Some languages (e.g. the Alpha language =-=[8]-=-) have already been designed to describe such equations. Alpha variables are spatial variables, i.e. triplets ! D; OE; V ? where the function OE associates to each point of the convex domain D a value... |

13 |
A Unified Semantic Approach for the Vectorization and Parallelization of Generalized Reductions
- Jouvelot, Dehbonei
(Show Context)
Citation Context ...on of the method. In the interest of conciseness, most proofs have been omitted. They may be found in full in [10]. 2 State of the Art Some papers on reductions detection have already been published (=-=[5]-=- and [9]). The first presents a method based on symbolic stores and the last a method based on the dependence graph. 1 some commercial compilers will recognize this form as an idiom and compile it eff... |

12 |
Reduction operators in alpha
- Verge
- 1992
(Show Context)
Citation Context ... 2x:x + a i 1 ;i 2 ; (i1 :0))(i; j) if j ? 1si ? 1 6.3 Comparison to Other Recurrence Operators Some other recurrence operators already exist, namely the reduction operator in the Alpha language (see =-=[6]-=-) and the scan primitives also known as parallel prefix operations (see [3]). However we have introduced our own recurrence operator for the following motives. The Alpha operator is an operator on un-... |

2 |
D'etection des r'eductions
- Redon
- 1992
(Show Context)
Citation Context ...sional recurrences detection. The conclusion includes some informations on an implementation of the method. In the interest of conciseness, most proofs have been omitted. They may be found in full in =-=[10]-=-. 2 State of the Art Some papers on reductions detection have already been published ([5] and [9]). The first presents a method based on symbolic stores and the last a method based on the dependence g... |