Whole program paths
James R. Larus · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · 1999
Whole program paths (WPP) 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 hot subpaths, which are the heavily executed sequences of code that should be the focus of performance tuning and compiler optimization.
Cited by 362 works. doi:10.1145/301618.301678 Open-access PDF
Authors
References
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- ATOM
- Trace Scheduling: A Technique for Global Microcode Compaction
- Benchmark Handbook: For Database and Transaction Processing Systems
- EEL
- Making paths explicit in the Scout operating system
- Imperative functional programming
- Optimistic incremental specialization
- Parallel processing
- Trace Cache: A Low Latency Approach to High Bandwidth Instruction Fetching