2D-profiling: detecting input-dependent branches with a single input data set

@article{Kim20062DprofilingDI,
  title={2D-profiling: detecting input-dependent branches with a single input data set},
  author={Hyesoon Kim and M. Aater Suleman and Onur Mutlu and Yale N. Patt},
  journal={International Symposium on Code Generation and Optimization (CGO'06)},
  year={2006},
  pages={11 pp.-172}
}
Static compilers use profiling to predict run-time program behavior. Generally, this requires multiple input sets to capture wide variations in run-time behavior. This is expensive in terms of resources and compilation time. We introduce a new mechanism, 2D-profiling, which profiles with only one input set and predicts whether the result of the profile would change significantly across multiple input sets. We use 2D-profiling to predict whether a branch's prediction accuracy varies across input… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 11 CITATIONS

Adding 2 D-Profiling Support in ORC

VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Autocorrelation analysis: A new and improved method for branch predictability characterization

VIEW 1 EXCERPT
CITES BACKGROUND

Introducing abstraction to vulnerability analysis

VIEW 2 EXCERPTS
CITES BACKGROUND

Profile-assisted Compiler Support for Dynamic Predication in Diverge-Merge Processors

VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-3 OF 3 REFERENCES

A lightweight algorithm for dynamic if-conversion during dynamic optimization

  • Kim M. Hazelwood, Thomas M. Conte
  • Computer Science
  • Proceedings 2000 International Conference on Parallel Architectures and Compilation Techniques (Cat. No.PR00622)
  • 2000
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL