Glenn Ammons  Home/Search
Context Related
| wisc.edu/wwt/pldi98_dataflow.ps wisc.edu/~larus/Pa...lifieddataflow.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wisc.edu/~wwt/wwt_papers (more) Homepages: G.Ammons |
Rate this article:      (best)Comment on this article |
Abstract: Data-flow analysis computes its solutions over the paths in a control-flow graph. These paths---whether feasible or infeasible, heavily or rarely executed---contribute equally to a solution. However, programs execute only a small fraction of their potential paths and, moreover, programs' execution time and cost is concentrated in a far smaller subset of hot paths. This paper describes a new approach to analyzing and optimizing programs, which improves the precision of data flow analysis along... (Update)
Cited by: More
Fast Paths in Concurrent Programs - Xu, Kumar, Li (2004) (Correct)
A Characterization of Traces in Java Programs - Borys Bradel And (Correct)
Speculative Alias Analysis for Executable Code - Manel Fernandez And (2002) (Correct)
Active bibliography (related documents): More All
0.0: Macroservers: An Execution Model for DRAM Processor-In-Memory.. - Zima, al. (2000) (Correct)
0.0: Visualizing the Performance of Higher-Order Programs - Waddell, Ashley (1998) (Correct)
0.0: Analyzing Path Profiles with the Hot Path Browser - Ball, Larus, Rosay (1998) (Correct)
Similar documents based on text: More All
0.3: Mining Specifications - Ammons, Bodik, Larus (2002) (Correct)
0.3: Debugging Temporal Specifications with Concept Analysis - Ammons, Mandelin.. (2003) (Correct)
0.2: Interprocedural Path Profiling - Melski, Reps (1998) (Correct)
Related documents from co-citation: More All
12: Efficient path profiling - Ball, Larus - 1996
11: Path Profile Guided Partial Dead Code Elimination Using Predication - Gupta, Berson et al. - 1997
9: Path Profile Guided Partial Redundancy Elimination Using Speculation - Gupta, Berson et al. - 1997
BibTeX entry: (Update)
Glenn Ammons and James L. Larus. Improving data-flow analysis with path profiles. In Proceedings of the ACM SIGPLAN '98 Conference on Programming Language Design and Implementation, 1998. http://citeseer.ist.psu.edu/ammons98improving.html More
@inproceedings{ ammons98improving,
author = "Glenn Ammons and James R. Larus",
title = "Improving Data-flow Analysis with Path Profiles",
booktitle = "{SIGPLAN} Conference on Programming Language Design and Implementation",
pages = "72-84",
year = "1998",
url = "citeseer.ist.psu.edu/ammons98improving.html" }
Citations (may not include all citations):87 Exploiting hardware performance counters with flow and conte.. - Ammons, Ball et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.wisc.edu/~wwt/wwt_papers.html): More
Cache-Conscious Structure Definition - Chilimbi, Davidson, Larus (1999) (Correct)
HPF on Fine-Grain Distributed Shared Memory: Early Experience - Chandra, Larus (1996) (Correct)
LCM: Memory System Support for Parallel Language.. - Larus, Richards.. (1994) (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