Selective path profiling

@inproceedings{Apiwattanapong2002SelectivePP,
  title={Selective path profiling},
  author={T. Apiwattanapong and M. J. Harrold},
  booktitle={PASTE '02},
  year={2002}
}
Recording dynamic information for only a subset of program entities can reduce monitoring overhead and can facilitate efficient monitoring of deployed software. Program entities, such as statements, can be monitored using probes that track the execution of those entities. Monitoring more complicated entities, such as paths or definition-use associations, requires more sophisticated techniques that track not only the execution of the desired entities but also the execution of other entities with… Expand
A Technique of Profiling Selective Paths
  • L. Wang, Bixin Li
  • Computer Science
  • 2011 IEEE 35th Annual Computer Software and Applications Conference
  • 2011
TLDR
A novel technique called PSP (Profiling Selective Paths) has been introduced to profile selective paths, which can handle selection for both acyclic and cyclic paths, and increase the execution efficiency by early termination on uninterested paths. Expand
Profiling all paths: A new profiling technique for both cyclic and acyclic paths
TLDR
A new profiling technique called PAP (Profiling All Paths), which can profile all finite-length paths within a procedure, and is found to be effective and efficient in profiling both cyclic and acyclic paths. Expand
Profiling selected paths with loops
TLDR
A novel technique called Profiling Selected Paths (PSP) is introduced to profile selected paths, which enables custom selection for both acyclic and cyclic paths and increases the execution efficiency by early termination on uninteresting paths. Expand
P3: partitioned path profiling
Acyclic path profile is an abstraction of dynamic control flow paths of procedures and has been found to be useful in a wide spectrum of activities. Unfortunately, the runtime overhead of obtainingExpand
Profiling All Paths
TLDR
A new profiling technique called PAP (profiling all paths), which can profile finite-length paths inside a procedural and how to use PAP to profile executed sequences on the method level is discussed. Expand
Pertinent path profiling: Tracking interactions among relevant statements
TLDR
This work proposes a new profiling technique, Pertinent Path Profiling, which attempts to unveil high-level interactions among a set of pertinent basic-blocks efficiently, revealing execution demeanors that are otherwise difficult to discover via current control-flow profiling schemes. Expand
Property-aware program sampling
TLDR
The sampling technique uses program slicing to reduce the scope of instrumentation and slice fragments to decompose large program slices into more manageable, logically related parts for instrumentation, thereby improving the scalability of monitoring and profiling techniques. Expand
Monitoring software using property-aware program sampling
TLDR
The sampling technique uses program slicing to reduce the scope of instrumentation and slice fragments to decompose large program slices into more manageable, logically related parts for instrumentation, thereby improving the scalability of monitoring and profiling techniques. Expand
Targeted path profiling: lower overhead path profiling for staged dynamic optimization systems
TLDR
The results suggest that on average the overhead of profile collection can be reduced by half (SPEC95) to almost two-thirds (SPEC2000) relative to the Ball-Larus algorithm with minimal impact on the information collected. Expand
Preferential path profiling: compactly numbering interesting paths
TLDR
A new algorithm called preferential path profiling (PPP), that reduces the overhead of path profiling, and draws a parallel between arithmetic coding and path numbering, and uses this connection to prove an optimality result for the compactness of path numbering produced by PPP. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 15 REFERENCES
Efficient path profiling
  • T. Ball, J. Larus
  • Computer Science
  • Proceedings of the 29th Annual IEEE/ACM International Symposium on Microarchitecture. MICRO 29
  • 1996
TLDR
A new algorithm for path profiling is described, which selects and places profile instrumentation to minimize run-time overhead and identifies longer paths than a previous technique, which predicted paths from edge profiles. Expand
Edge profiling versus path profiling: the showdown
TLDR
Results indicate the usefulness of the algorithms for characterizing edge profiles and selecting hot paths, and show that various hot path selection algorithms based on edge profiles work extremely well in most cases, but that path profiling is needed in some cases. Expand
Interprocedural path profiling and the interprocedural express-lane transformation
The contributions of this thesis can be broadly divided into two categories: we present novel path-profiling techniques, and we present techniques for performing the express-lane transformation, aExpand
Software profiling for hot path prediction: less is more
Recently, there has been a growing interest in exploiting profile information in adaptive systems such as just-in-time compilers, dynamic optimizers and, binary translators. In this paper, we showExpand
Efficiently counting program events with support for on-line queries
TLDR
This paper represents an instrumentation method for efficiently counting events in a program's execution, with support for on-line queries of the event count, and guarantees that accurate event counts can be obtained efficiently at every point in the execution. Expand
A framework for reducing the cost of instrumented code
TLDR
A general framework for performing instrumentation sampling to reduce the overhead of previously expensive instrumentation, using code-duplication and counter-based sampling to allow switching between instrumented and non-instrumented code. Expand
Dynamically discovering likely program invariants to support program evolution
TLDR
This paper describes techniques for dynamically discovering invariants, along with an instrumenter and an inference engine that embody these techniques, and reports on the application of the engine to two sets of target programs. Expand
Whole program paths
TLDR
This paper explains how to collect and represent Whole program paths and 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. Expand
Residual test coverage monitoring
  • C. Pavlopoulou, M. Young
  • Engineering, Computer Science
  • Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002)
  • 1999
TLDR
Experience with a prototype tool for residual test coverage monitoring of Java programs suggests that, at least for statement coverage, the simple strategy of removing all probes except those corresponding to the residue of coverage testing reduces execution overhead to acceptably low levels. Expand
Visualization of test information to assist fault localization
TLDR
A new technique that uses color to visually map the participation of each program statement in the outcome of the execution of the program with a test suite, consisting of both passed and failed test cases is presented. Expand
...
1
2
...