Optimally profiling and tracing programs

@article{Ball1994OptimallyPA,
  title={Optimally profiling and tracing programs},
  author={T. Ball and J. Larus},
  journal={ACM Trans. Program. Lang. Syst.},
  year={1994},
  volume={16},
  pages={1319-1360}
}
  • T. Ball, J. Larus
  • Published 1994
  • Computer Science
  • ACM Trans. Program. Lang. Syst.
  • This paper describes algorithms for inserting monitoring code to profile and trace programs. These algorithms greatly reduce the cost of measuring programs with respect to the commonly used technique of placing code in each basic block. Program profiling counts the number of times each basic block in a program executes. Instruction tracing records the sequence of basic blocks traversed in a program execution. The algorithms optimize the placement of counting/tracing code with respect to the… CONTINUE READING
    Efficient path profiling
    • 636
    • PDF
    Optimally profiling and tracing programs
    • 278
    • PDF
    Continuous profiling: where have all the cycles gone?
    • 383
    The concept of dynamic analysis
    • 288
    • PDF
    A brief survey of program slicing
    • 263

    References

    Publications referenced by this paper.
    SHOWING 1-7 OF 7 REFERENCES
    Determining average program execution times and their variance
    • 187
    • Highly Influential
    Optimal Insertion of Software Probes in Well-Delimited Programs
    • 38
    • Highly Influential
    Data structures and network algorithms
    • 2,134
    • Highly Influential
    Reducing overhead in counter-based execution profiling
    • 13
    • Highly Influential
    Samples, “Profile-driven compilation,
    • 1991
    The art of computer programming. Vol.1: Fundamental algorithms
    • 984
    • Highly Influential
    Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran
    • 4,763
    • Highly Influential