(Enter summary)
Abstract: Memory expansions are classical means to extract parallelism
from imperative programs. However, for dynamic
control programs with general memory accesses, such transformations
either fail or require some run-time mechanism
to restore the data flow. This paper presents an expansion
framework for any type of data structure in any imperative
program, without the need for dynamic data flow restoration.
The key idea is to group together the write operations
that participate in the flow of the same... (Update)
Cited by: More
Maximal Static Expansion - Barthou, Cohen, Collard (2000)
(Correct)
Deep Jam: Conversion of Coarse-Grain Parallelism to.. - Carribault, Cohen, Jalby (2005)
(Correct)
Parallelization via Constrained Storage Mapping Optimization - Albert Cohen Prism (1999)
(Correct)
Similar documents (at the sentence level):
14.9%: Unknown - Ese De Doctorat
(Correct)
13.5%: The Interplay of Expansion and Scheduling in PAF - Feautrier, Collard.. (1998)
(Correct)
Active bibliography (related documents): More All
0.2: Constraint-Based Array Dependence Analysis - William Pugh, David Wonnacott (1998)
(Correct)
0.2: Optimization of Storage Mappings for Parallel Programs - Cohen, Lefebvre (1998)
(Correct)
0.1: Storage Mapping Optimization for Parallel - Programs Albert Cohen
(Correct)
Similar documents based on text: More All
0.5: Partial Redundancy Elimination on Predicated Code - Knoop, Collard, Ju (1999)
(Correct)
0.4: Fuzzy Array Dataflow Analysis - Barthou, Collard, Feautrier (1997)
(Correct)
0.4: Instance-wise Reaching Definition Analysis for Recursive.. - Cohen, Collard (1998)
(Correct)
Related documents from co-citation: More All
13: Supernode partitioning (context) - Irigoin, Triolet - 1988
12: Maximizing parallelism and minimizing synchronization with affine transforms
- Lim, Lam - 1997
10: Automatic storage management for parallel programs
- Lefebvre, Feautrier - 1998
BibTeX entry: (Update)
Denis Barthou, Albert Cohen, and Jean-Fran¸cois Collard. Maximal static expansion. In Principles of Programming Languages, January 1998. http://citeseer.ist.psu.edu/article/barthou98maximal.html More
@inproceedings{ barthou98maximal,
author = "Denis Barthou and Albert Cohen and Jean-Francois Collard",
title = "Maximal Static Expansion",
booktitle = "Symposium on Principles of Programming Languages",
pages = "98-106",
year = "1998",
url = "citeseer.ist.psu.edu/article/barthou98maximal.html" }
Citations (may not include all citations):
415
Efficiently computing static single assignment form and the ..
- Cytron, Ferrante et al. - 1991
245
The omega test: a fast and practical integer programming alg..
- Pugh - 1992
169
Scanning polyhedra with DO loops
- Ancourt, Irigoin - 1991
152
An efficient method of computing static single assignment fo.. (context) - Cytron, Ferrante et al. - 1989
106
Automatic array privatization
- Tu, Padua - 1993
101
Array dataflow analysis and its use in array privatization (context) - Maydan, Amarasinghe et al. - 1993
67
Dataflow analysis of scalar and array references (context) - Feautrier - 1991
54
Fuzzy array dataflow analysis
- Barthou, Collard et al. - 1997
54
Fuzzy array dataflow analysis
- Collard, Barthou et al. - 1995
31
Construction of DO loops from systems of affine constraints
- Collard, Feautrier et al. - 1995
31
Nonlinear array dependence analysis
- Wonnacott, Pugh - 1995
25
Constraint-Based Array Dependence Analysis (context) - Wonnacott - 1995
16
Transitive closure of infinite graphs and its applications
- Kelly, Pugh et al. - 1996
14
A comparative study of automatic vectorizing compilers
- Levine, Callahan et al. - 1993
14
Generation of synchronous code for automatic parallelization..
- Griebl, Collard - 1995
13
Ecole des Mines de Paris (context) - Creusillet, Analyses et al. - 1996
6
Computer Systems Laboratory (context) - Pieper, Implementation et al. - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-rocq.inria.fr/~acohen/publications/publications.html.en): More
Instance-wise Reaching Definition Analysis for Recursive.. - Cohen, Collard (1998)
(Correct)
The New Framework for Loop Nest Optimization in GCC.. - Pop, Cohen, Jouvelot, .. (2006)
(Correct)
Induction Variable Analysis without Idiom Recognition.. - Wu, Cohen, Padua (2001)
(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