返回Google圖書搜尋

Optimally Profiling and Tracing Programs

出版	University of Wisconsin-Madison, Computer Sciences Department, 1991
URL	http://books.google.com.hk/books?id=P1alPgAACAAJ&hl=&source=gbs_api

註釋Abstract: "This paper presents two algorithms for inserting monitoring code to profile and trace programs. These algorithms greatly reduce the cost of measuring programs. Profiling, which counts the number of times each basic block in a program executes, is widely used to measure instruction set utilization of computers, identify program bottlenecks, and estimate program execution times for code optimization. Instruction traces are the basis for trace-driven simulation and analysis and are used also in trace-driven debugging. The profiling algorithm instruments a program for profiling by choosing a placement of counters that is optimized -- and frequently optimal -- with respect to the expected or measured execution frequency of each basic block and branch in the program.