Travelled to:1 × France
12 × USA
Collaborated with:L.Carter R.Cytron B.Calder B.Simon M.M.Strout V.Sarkar M.Mace K.J.Ottenstein W.Chuang C.D.Thomborson K.Högstedt V.Bala J.Choi B.K.Rosen M.N.Wegman F.K.Zadeck M.G.Burke W.C.Hsieh D.Shields
Talks about:time (4) data (4) predic (3) represent (2) parallel (2) explicit (2) automat (2) depend (2) compil (2) graph (2)
Person: Jeanne Ferrante
 DBLP: Ferrante:Jeanne
Facilitated 3 volumes:
Contributed to:
Wrote 13 papers:
- CGO-2003-ChuangCF
 - Phi-Predication for Light-Weight If-Conversion (WC, BC, JF), pp. 179–192.
 - HPCA-2003-SimonCF #branch #predict
 - Incorporating Predicate Information into Branch Predictors (BS, BC, JF), pp. 53–64.
 - PLDI-2003-StroutCF #composition #runtime
 - Compile-time composition of run-time data and iteration reorderings (MMS, LC, JF), pp. 91–102.
 - POPL-2003-CarterFT #graph
 - Folklore confirmed: reducible flow graphs are exponentially larger (LC, JF, CDT), pp. 106–114.
 - ASPLOS-1998-StroutCFS #independence
 - Schedule-Independent Storage Mapping for Loops (MMS, LC, JF, BS), pp. 24–33.
 - POPL-1997-CarterFH
 - Determining the Idle Time of a Tiling (KH, LC, JF), pp. 160–173.
 - PPoPP-1993-BalaFC #optimisation #representation
 - Explicit Data Placement (XDP): A Methodology for Explicit Compile-Time Representation and Optimization (VB, JF, LC), pp. 139–148.
 - POPL-1991-ChoiCF #automation #data flow #evaluation #graph
 - Automatic Construction of Sparse Data Flow Evaluation Graphs (JDC, RC, JF), pp. 55–66.
 - PLDI-1990-CytronFS #dependence
 - Compact Representations for Control Dependence (RC, JF, VS), pp. 337–351.
 - POPL-1989-CytronFRWZ #performance
 - An Efficient Method of Computing Static Single Assignment Form (RC, JF, BKR, MNW, FKZ), pp. 25–35.
 - PPEALS-1988-BurkeCFHSS #automation #empirical #parallel
 - Automatic Discovery of Parallelism: A Tool and an Experiment (MGB, RC, JF, WCH, VS, DS), pp. 77–84.
 - POPL-1985-FerranteM #on the #parallel
 - On Linearizing Parallel Code (JF, MM), pp. 179–189.
 - POPL-1983-FerranteO #dependence
 - A Program Form Based on Data Dependency in Predicate Regions (JF, KJO), pp. 217–236.
 

















