Whole Program Paths

Abstract

<i>Whole program paths (WPP)</i> are a new approach to capturing and representing a program's dynamic---actually executed---control flow. Unlike other path profiling techniques, which record intraprocedural or acyclic paths, WPPs produce a single, compact description of a program's entire control flow, including loop iteration and interprocedural paths.This paper explains how to collect and represent WPPs. It also shows how to use WPPs to find <i>hot subpaths</i>, which are the heavily executed sequences of code that should be the focus of performance tuning and compiler optimization.

DOI: 10.1145/301618.301678

Extracted Key Phrases

8 Figures and Tables

02040'99'01'03'05'07'09'11'13'15'17
Citations per Year

379 Citations

Semantic Scholar estimates that this publication has 379 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Larus1999WholePP, title={Whole Program Paths}, author={James R. Larus}, booktitle={PLDI}, year={1999} }