The calling context tree (CCT) is a data structure for recording
context-sensitive profiling information. The CCT can be expensive to
construct since it requires instrumenting all procedure entries and
exits. This paper presents an algorithm for constructing an
approximate CCT (ACCT) by performing periodic call-stack sampling.
Results from a preliminary implementation are reported validating the
accuracy of our technique.
By: Matthew Arnold, Peter Sweeney
Published in: RC21789 in 2000
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .