See this document in CiteSeerX!

Path Profile Guided Partial Redundancy Elimination Using Speculation (1997)  (Make Corrections)  (24 citations)
Rajiv Gupta, David A. Berson, Jesse Z. Fang
International Conference on Computer Languages



  Home/Search   Context   Related

 
View or download:
pitt.edu/~gupta/research/C...iccl98b.ps
arizona.edu/people/gupta/r...iccl98b.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  pitt.edu/~gupta/research...recent (more)
(Enter author homepages)

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

Abstract: While programs contain a large number of paths, a very small fraction of these paths are typically exercised during program execution. Thus, optimization algorithms should be designed to trade off the performance of less frequently executed paths in favor of more frequently executed paths. However, traditional formulations to code optimizations are incapable of performing such a trade-off. We present a path profile guided partial redundancy elimination algorithm that uses speculation to enable... (Update)

Cited by:   More
Whole Execution Traces - Xiangyu Zhang Rajiv   (Correct)
Speculative Alias Analysis for Executable Code - Manel Fernandez And (2002)   (Correct)
Permission to Make Digital Or Hard Copies of All Or Part of This .. - Classroom   (Correct)

Similar documents (at the sentence level):
5.4%:   Path Profile Guided Partial Dead Code Elimination Using.. - Gupta, Berson, Fang (1997)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Register Pressure Sensitive Redundancy Elimination - Gupta, Bodík (1999)   (Correct)
0.3:   Resource-Sensitive Profile-Directed Data Flow Analysis for Code .. - Rajiv Gupta (1997)   (Correct)
0.2:   Code Optimization as a Side Effect of Instruction Scheduling - Gupta (1997)   (Correct)

Similar documents based on text:   More   All
0.9:   Optimal and Efficient Speculation-based Partial Redundancy.. - Qiong, Xue (2003)   (Correct)
0.1:   URSA: A Unified ReSource Allocator for Registers and.. - David Berson (1992)   (Correct)
0.1:   Technical Report 94-10 Representing Architecture.. - Berson, Gupta, Soffa   (Correct)

Related documents from co-citation:   More   All
12:   Path Profile Guided Partial Dead Code Elimination Using Predication - Gupta, Berson et al. - 1997
11:   Data flow frequency analysis - Ramalingam - 1996
11:   Compilers: Principles (context) - Aho, Sethi et al. - 1986

BibTeX entry:   (Update)

R. Gupta, D. Berson, and J.Z. Fang, "Path Profile Guided Partial Redundancy Elimination Using Speculation, " Technical Report TR-97-13, Dept. of Computer Science, University of Pittsburgh, 1997. http://citeseer.ist.psu.edu/article/gupta97path.html   More

@inproceedings{ gupta98path,
    author = "Rajiv Gupta and David A. Berson and Jesse Zhixi Fang",
    title = "Path Profile Guided Partial Redundancy Elimination Using Speculation",
    booktitle = "International Conference on Computer Languages",
    pages = "230-239",
    year = "1998",
    url = "citeseer.ist.psu.edu/article/gupta97path.html" }
Citations (may not include all citations):
104   Lazy Code Motion - Knoop, Ruthing et al. - 1992
103   Efficient path profiling - Ball, Larus - 1996
47   Sentinel Scheduling for VLIW and Superscalar Processors - Mahlke - 1992
36   A New Algorithm for Partial Redundancy Elimination based upo.. - Chow, Chan et al. - 1997
30   Interprocedural Conditional Branch Elimination - Bodik, Gupta et al. - 1997
27   Data Flow Analysis as Model Checking (context) - Steffen - 1991
26   Path Profile Guided Partial Dead Code Elimination using Pred.. - Gupta, Berson et al. - 1997
15   ResourceSensitive Profile-Directed Data Flow Analysis for Co.. - Gupta, Berson et al. - 1997
10   Complete Removal of Redundant Computations (context) - Bodik, Gupta et al. - 1998
10   Partial Redundancy Elimination Driven by a Cost-Benefit Anal.. - Horspool, Ho - 1997
9   Partial Dead Code Elimination using Slicing Transformations - Bodik, Gupta - 1997
9   Array Data-Flow Analysis for Load-Store Optimizations in Sup.. (context) - Bodik, Gupta - 1996
2   Compiler Algorithms on If-Conversion, Speculative Predicates.. (context) - Fang - 1996



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.pitt.edu/~gupta/research/recent.html):   More
Data Flow Analysis Driven Dynamic Data Partitioning - Tims, Gupta, Soffa (1998)   (Correct)
Register Pressure Sensitive Redundancy Elimination - Gupta, Bodík (1999)   (Correct)
SPMD Execution in the Presence of Dynamic Data Structures - Gupta   (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