Dynamic analysis mechanism for computer program hot spot

Abstract

The invention relates to a dynamic discovery method for a computer program hot spot module, in particular to a dynamic analysis mechanism for information when a computer program is executed. In the mechanism, instructions and address data of a user program are captured when transmitted on a bus. The mechanism comprises the steps of: performing decoding identification and selective classification on the instructions, then forming specific program path descriptors according to the classified branch instructions and execution results thereof and address information, performing statistics and analysis, and finally storing the acquired hot spot descriptors in a special storage module. The mechanism can be applied to different computer system structures, is used as an internal function component or an external co-processing component of a computer processor, and greatly improves the parallelism of computer program execution so as to greatly promote the performance of program execution; and meanwhile, the mechanism can be used as an independent reusable component and applied to various situations for program hot spot identification.

Description

technical field [0001] The invention relates to a method for dynamically discovering frequently executed hotspot modules in computer programs, in particular to a dynamic analysis mechanism based on path analysis utilizing computer program execution process information. Background technique [0002] More than 90% of the program execution time is consumed in about 10% of the code, the hot code. Optimizing hot code can significantly improve program performance. In the research of instruction set expansion and dynamic binary translation, hotspot identification technology has important applications. [0003] The concept of program path has been mentioned in academia for a long time. In 1996, Ball and Larus of the University of Wisconsin proposed a feasible method for path analysis information, which can automatically and effectively complete the analysis and statistics of the acyclic sequence (BL path) in the process. The BL path has two main defects: one is that it is limited...

AI Technical Summary

Problems solved by technology

The BL path has two main defects: one is that it is limited to a single basic block, and cannot provide information about cross-process and cross-loop in the program control flow;

Software analysis is easy to modify and collect information is complete, but the analysis cost is relatively large, and the accuracy depends on well-designed test codes

Images