Sciweavers

7 search results - page 1 / 2
» Software Profiling for Hot Path Prediction: Less is More
Sort
View
ASPLOS
2000
ACM
13 years 8 months ago
Software Profiling for Hot Path Prediction: Less is More
Recently, there has been a growing interest in exploiting profile information in adaptive systems such as just-in-time compilers, dynamic optimizers and, binary translators. In th...
Evelyn Duesterwald, Vasanth Bala
CGO
2007
IEEE
13 years 8 months ago
Shadow Profiling: Hiding Instrumentation Costs with Parallelism
In profiling, a tradeoff exists between information and overhead. For example, hardware-sampling profilers incur negligible overhead, but the information they collect is consequen...
Tipp Moseley, Alex Shye, Vijay Janapa Reddi, Dirk ...
ICSE
2009
IEEE-ACM
14 years 5 months ago
The road not taken: Estimating path execution frequency statically
A variety of compilers, static analyses, and testing frameworks rely heavily on path frequency information. Uses for such information range from optimizing transformations to bug ...
Raymond P. L. Buse, Westley Weimer
ICSE
2003
IEEE-ACM
14 years 4 months ago
Whole Program Path-Based Dynamic Impact Analysis
Impact analysis, determining when a change in one part of a program affects other parts of the program, is timeconsuming and problematic. Impact analysis is rarely used to predict...
James Law, Gregg Rothermel
CGO
2003
IEEE
13 years 8 months ago
Optimal and Efficient Speculation-Based Partial Redundancy Elimination
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
Qiong Cai, Jingling Xue