Jeanne Ferrante

Affiliations:
  • University of California, San Diego, USA


According to our database1, Jeanne Ferrante authored at least 65 papers between 1975 and 2016.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 1996, "For the development of intermediate program representations for program optimization and parallelization that are fundamental to current optimizing compilers.".

IEEE Fellow

IEEE Fellow 2005, "For contributions to optimizing and parallelizing compilers.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016
An approach for code generation in the Sparse Polyhedral Framework.
Parallel Comput., 2016

2014
Author retrospective for PTRAN's analysis and optimization techniques.
Proceedings of the ACM International Conference on Supercomputing 25th Anniversary Volume, 2014

2008
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications.
IEEE Trans. Parallel Distributed Syst., 2008

2006
Interference-Aware Scheduling.
Int. J. High Perform. Comput. Appl., 2006

Preface.
Int. J. High Perform. Comput. Appl., 2006

Centralized versus distributed schedulers for multiple bag-of-task applications.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

2005
GUARD: Gossip Used for Autonomous Resource Detection.
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

2004
Scheduling Strategies for Master-Slave Tasking on Heterogeneous Processor Platforms.
IEEE Trans. Parallel Distributed Syst., 2004

Sparse Tiling for Stationary Iterative Methods.
Int. J. High Perform. Comput. Appl., 2004

On the Interference of Communication on Computation in Java.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

A-FAST: Autonomous Flow Approach to Scheduling Tasks.
Proceedings of the High Performance Computing, 2004

2003
On the Parallel Execution Time of Tiled Loops.
IEEE Trans. Parallel Distributed Syst., 2003

Folklore confirmed: reducible flow graphs are exponentially larger.
Proceedings of the Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2003

Compile-time composition of run-time data and iteration reorderings.
Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation 2003, 2003

TFP: Time-Sensitive, Flow-Specific Profiling at Runtime.
Proceedings of the Languages and Compilers for Parallel Computing, 2003

Autonomous Protocols for Bandwidth-Centric Scheduling of Independent-Task Applications.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Incorporating Predicate Information into Branch Predictors.
Proceedings of the Ninth International Symposium on High-Performance Computer Architecture (HPCA'03), 2003

Phi-Predication for Light-Weight If-Conversion.
Proceedings of the 1st IEEE / ACM International Symposium on Code Generation and Optimization (CGO 2003), 2003

2002
Combining Performance Aspects of Irregular Gauss-Seidel Via Sparse Tiling.
Proceedings of the Languages and Compilers for Parallel Computing, 15th Workshop, 2002

Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms.
Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

2001
Rescheduling for Locality in Sparse Matrix Computations.
Proceedings of the Computational Science - ICCS 2001, 2001

A Modal Model of Memory.
Proceedings of the Computational Science - ICCS 2001, 2001

2000
CROPS: coordinated restructuring of programs and storage.
ACM SIGSOFT Softw. Eng. Notes, 2000

Path Analysis and Renaming for Predicated Instruction Scheduling.
Int. J. Parallel Program., 2000

1999
Selecting Tile Shape for Minimal Execution Time.
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

ILP versus TLP on SMT.
Proceedings of the ACM/IEEE Conference on Supercomputing, 1999

Asynchronous Dynamic Load Balancing of Tiles.
Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, 1999

Localizing Non-Affine Array References.
Proceedings of the 1999 International Conference on Parallel Architectures and Compilation Techniques, 1999

Predicated Static Single Assignment.
Proceedings of the 1999 International Conference on Parallel Architectures and Compilation Techniques, 1999

1998
Quantifying the Multi-Level Nature of Tiling Interactions.
Int. J. Parallel Program., 1998

Analyzing Asynchronous Pipeline Schedules.
Int. J. Parallel Program., 1998

Schedule-Independent Storage Mapping for Loops.
Proceedings of the ASPLOS-VIII Proceedings of the 8th International Conference on Architectural Support for Programming Languages and Operating Systems, 1998

1997
Compile-time Analysis and Optimization of Explicitly Parallel Programs*.
Parallel Algorithms Appl., 1997

Determining the Idle Time of a Tiling.
Proceedings of the Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1997

1996
Determing Asynchronous Pipeline Execution Times.
Proceedings of the Languages and Compilers for Parallel Computing, 1996

Determining Asynchronous Acyclic Pipeline Execution Times.
Proceedings of IPPS '96, 1996

1995
Efficientlty Computing Phi-Nodes On-The-Fly.
ACM Trans. Program. Lang. Syst., 1995

Efficient Parallelism via Hierarchical Tiling.
Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing, 1995

Hierarchical tiling for improved superscalar performance.
Proceedings of IPPS '95, 1995

1994
On the Efficient Engineering of Ambitious Program Analysis.
IEEE Trans. Software Eng., 1994

Static Slicing in the Presence of Goto Statements.
ACM Trans. Program. Lang. Syst., 1994

XDP: A compiler intermediate language extension for the representation and optimization of data movement.
Int. J. Parallel Program., 1994

Computing Communication Sets for Control Parallel Programs.
Proceedings of the Languages and Compilers for Parallel Computing, 1994

1993
Explicit Data Placement (XDP): A Methodology for Explicit Compile-Time Representation and Optimization.
Proceedings of the Fourth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPOPP), 1993

Efficiently Computing phi-Nodes On-The-Fly (Extended Abstract).
Proceedings of the Languages and Compilers for Parallel Computing, 1993

1992
Explicit Data Placement (XDP): A Methodology for Explicit Compile-Time Representation and Optimization of Data Movement (Extended Abstract).
Proceedings of the 2nd SIGPLAN Workshop on Languages, Compilers, and Run-Time Environments for Distributed Memory Multiprocessors, Boulder, Colorado, September 30, 1992

1991
Efficiently Computing Static Single Assignment Form and the Control Dependence Graph.
ACM Trans. Program. Lang. Syst., 1991

Automatic Construction of Sparse Data Flow Evaluation Graphs.
Proceedings of the Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, 1991

On Estimating and Enhancing Cache Effectiveness.
Proceedings of the Languages and Compilers for Parallel Computing, 1991

1990
A Foundation for Sequentializing Parallel Code.
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

Compact Representations for Control Dependence.
Proceedings of the ACM SIGPLAN'90 Conference on Programming Language Design and Implementation (PLDI), 1990

1989
Automatic generation of nested, fork-join parallelism.
J. Supercomput., 1989

An Efficient Method of Computing Static Single Assignment Form.
Proceedings of the Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1989

1988
An Overview of the PTRAN Analysis System for Multiprocessing.
J. Parallel Distributed Comput., 1988

Automatic Discovery of Parallelism: A Tool and an Experiment (Extended Abstract).
Proceedings of the ACM/SIGPLAN PPEALS 1988, 1988

Generating sequential code from parallel code.
Proceedings of the 2nd international conference on Supercomputing, 1988

A framework for determining useful parallelism.
Proceedings of the 2nd international conference on Supercomputing, 1988

1987
The Program Dependence Graph and Its Use in Optimization.
ACM Trans. Program. Lang. Syst., 1987

What's In a Name? -or- The Value of Renaming for Parallelism Detection and Storage Allocation.
Proceedings of the International Conference on Parallel Processing, 1987

1985
On Linearizing Parallel Code.
Proceedings of the Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, 1985

1983
High level language debugging with a compiler.
Proceedings of the symposium on High-level debugging, 1983

A Program Form Based on Data Dependency in Predicate Regions.
Proceedings of the Conference Record of the Tenth Annual ACM Symposium on Principles of Programming Languages, 1983

1980
The Experimental Compiling System.
IBM J. Res. Dev., 1980

1977
An Efficient Decision Procedure for the Theory of Rational Order.
Theor. Comput. Sci., 1977

1975
A Decision Procedure for the First Order Theory of Real Addition with Order.
SIAM J. Comput., 1975


  Loading...