See this document in CiteSeerX!

Storage Mapping Optimization for Parallel  (Make Corrections)  
Programs Albert Cohen and Vincent Lefebvre PRiSM, Universit'e de Versailles,...



  Home/Search   Context   Related

 
View or download:
rocq.inria.fr/~acohen/publ...CL99.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  rocq.inria.fr/~...cations.html.en (more)
(Enter author homepages)

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

Abstract: Data dependences are known to hamper efficient parallelization of programs. Memory expansion is a general method to remove dependences in assigning distinct memory locations to dependent writes. (Update)

Similar documents based on text:   More   All
0.7:   Optimization of Storage Mappings for Parallel Programs - Cohen, Lefebvre (1998)   (Correct)
0.4:   Storage Management in Parallel Programs - Lefebvre, Feautrier (1996)   (Correct)
0.3:   Parallelization via Constrained Storage Mapping Optimization - Cohen (1999)   (Correct)

BibTeX entry:   (Update)

@misc{ cohen-storage,
  author = "Programs Albert Cohen",
  title = "Storage Mapping Optimization for Parallel",
  url = "citeseer.ist.psu.edu/735113.html" }
Citations (may not include all citations):
415   Efficiently computing static single assignment form and the .. - Cytron, Ferrante et al. - 1991
183   Some efficient solution to the affine scheduling problem - Feautrier - 1992
178   Supernode partitioning (context) - Irigoin, Triolet - 1988
164   A practical algorithm for exact array dependence analysis (context) - Pugh - 1992
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
25   Constraint-Based Array Dependence Analysis (context) - Wonnacott - 1995
19   Automatic storage management for parallel programs - Lefebvre, Feautrier - 1998
19   Optimal fine and medium grain parallelism detection in polyh.. - Darte, Vivien - 1997
13   Ecole des Mines de Paris (context) - Creusillet, Analyses et al. - 1996
10   Efficient multiprocessor parallelism via hierarchical tiling (context) - Carter, Ferrante et al. - 1995
10   Optimization of storage mappings for parallel programs - Cohen, Lefebvre - 1998
9   The advantages of reaching definition analyses in Array (context) - Collard - 1998

[Article contains additional citations not shown here]

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