This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The call-return tree and its application to program performance analysis
Nov. 1986 (vol. 12 no. 11)
pp. 1096-1098
Sukhamay Kundu, Department of Computer Science, Louisiana State University, Baton Rouge, LA 70803
We define the notion of a call-return tree to describe the dynamic calling relationship of the procedures and functions in a program execution. We show how the call-return tree can be used to compute the live times and the execution times of the various calls made during the execution. The live times and execution times are two important performance characteristics of a program. The call-return tree can also be used to compute other behavioral metrics such as the depth and height of a call and the number of direct and indirect calls generated from any point. The technique applies uniformly for both non-recursive and recursive calls. The various algorithms given here take linear time in the length of the source code and the number of calls made during an execution.
Index Terms:
Vegetation,Software,Silicon,Software algorithms,Probes,Monitoring,software probe,Algorithm,live and execution times,performance
Citation:
Sukhamay Kundu, "The call-return tree and its application to program performance analysis," IEEE Transactions on Software Engineering, vol. 12, no. 11, pp. 1096-1098, Nov. 1986, doi:10.1109/TSE.1986.6313000
Usage of this product signifies your acceptance of the Terms of Use.