• Cite Icon45
  • https://doi.org/10.1145/1190215.1190268Copy DOI Icon

Preferential path profiling

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This has limited their use in practice despite demonstrations of their advantages over edge profiles for a wide variety of applications.We present a new algorithm called preferential path profiling (PPP), that reduces the overhead of path profiling. PPP leverages the observation that most consumers of path profiles are only interested in a subset of all program paths. PPP achieves low overhead by separating interesting paths from other paths and assigning a set of unique and compact numbers to these interesting paths. We draw a parallel between arithmetic coding and path numbering, and use this connection to prove an optimality result for the compactness of path numbering produced by PPP. This compact path numbering enables our PPP implementation to record path information in an array instead of a hash table. Our experimental results indicate that PPP reduces the runtime overhead of profiling paths exercised by the largest (ref) inputs of the SPEC CPU2000 benchmarks from 50% on average (maximum of 132%) to 15% on average (maximum of 26%) as compared to a state-of-the-art path profiler.

Similar Papers
  • Conference Article
  • Citations53

Preferential path profiling

  • Jan 17, 2007
  • Kapil Vaswani +2
  • Conference Article
  • Citations102

Edge profiling versus path profiling

  • Jan 01, 1998
  • Thomas Ball +2
  • Conference Article
  • Citations418

Efficient path profiling

  • Dec 23, 2002
  • T Ball +1
  • Conference Article
  • Citations570

Efficient path profiling

  • Dec 02, 1996
  • Thomas Ball +1
  • Conference Article
  • Citations54

Practical Path Profiling for Dynamic Optimizers

  • Mar 31, 2005
  • M.D Bond +1
  • Conference Article
  • Citations31

Targeted path profiling: lower overhead path profiling for staged dynamic optimization systems

  • Jun 28, 2015
  • R Joshi +1
  • Conference Article
  • Citations46

Targeted path profiling: lower overhead path profiling for staged dynamic optimization systems

  • Mar 20, 2004
  • Rahul Raghvendra Joshi +2
  • Conference Article
  • Citations6

P3: partitioned path profiling

  • Aug 30, 2015
  • Mohammed Afraz +2
  • Conference Article
  • Citations16

Extending path profiling across loop backedges and procedure boundaries

  • Jun 10, 2004
  • S Tallam +2
  • Conference Article
  • Citations26

Extending path profiling across loop backedges and procedure boundaries

  • Mar 20, 2004
  • Sriraman Tallam +2
  • Conference Article
  • Citations39

Continuous Path and Edge Profiling

  • Oct 11, 2006
  • M.D Bond +1
  • Conference Article
  • Citations12

An efficient online path profiling framework for Java just-in-time compilers

  • Mar 22, 2004
  • T Yasue +3
  • Conference Article
  • Citations17

An efficient online path profiling framework for Java just-in-time compilers

  • Sep 27, 2003
  • Toshiaki Yasue +3
  • Conference Article
  • Citations10

Pertinent path profiling: Tracking interactions among relevant statements

  • Feb 01, 2013
  • R Chouhan +2
  • Conference Article
  • Citations37

A Programmable Hardware Path Profiler

  • Jan 01, 2005
  • K Vaswani +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.