Efficient Path Profiling

4/28/97


Click here to start


Table of Contents

Efficient Path Profiling

Path Profiling

Why Profile Paths?

How to Profile Paths?

Edge Profiling Not Enough

Efficient Path Profiling

Path Profiling Algorithm

Plenty of Paths

Experimental Results

Overview

Path Profiling DAGs

Edge Value Assignment

Edge Value Assignment

Example

Many Ways to Compute Sum

Minimal Increments

Increment Example

Instrumentation

Path Regeneration

Overview

Arbitrary Control Flow

Break Cycles at Backedges

Example

Pseudo Edges Fix Problem

Overview

Hardware Metrics

Call Graph Profiling

Calling Context Tree

Overview

Implementation

Path Space Blowup

Routines With Many Paths

Address Calculation

Overview

Run-time Overhead

Path Length

Instruction Distribution

Hot Paths

Train & Ref Dataset Overlap

Related Work

Conclusions

For More Information

Author: Thomas J. Ball

Email: larus@cs.wisc.edu

Home Page: http://www.cs.wisc.edu/~larus

Other information:
This is a copy of the slides for a talk describing Tom Ball's and my technique for path profiling.