Abstract: An apparatus and method for cataloging symbolic data for use in performance analysis of computer programs is provided. The apparatus and method stores symbolic data for loaded modules during or shortly after a performance trace and utilizes the stored symbolic data when performing a performance analysis at a later time. A merged symbol file is generated for a computer program, or application, under trace. The merged symbol file contains information useful in performing symbolic resolution of address information in trace files for each instance of a module. During post processing of the trace information generated by a performance trace of a computer program, symbolic information stored in the merged symbol file is compared to the trace information stored in the trace file. The correct symbolic information in the merged symbol file for loaded modules is identified based a number of validating criteria.

Abstract: A method and system for profiling a program using periodic trace sampling is provided. During the execution of the program, sample-based profiling of the executing program is performed—for a predetermined period, a profiler performs trace processing for the program, after which the profiler pauses and does not perform trace processing for a predetermined period or only performs lightweight processing for a predetermined period. The periods controlling the profiler may be selected by a user, and the periods may be measured by temporal or non-temporal metrics. The user may also specify parameters that are used to filter events so that profiling is performed only for specified threads or methods. The profiler cycles through these periods, during which selected events are processed to generate a profile of the execution flows within the program.

Abstract: An apparatus and method for cataloging symbolic data for use in performance analysis of computer programs is provided. The apparatus and method stores symbolic data for loaded modules during or shortly after a performance trace and utilizes the stored symbolic data when performing a performance analysis at a later time. A merged symbol file is generated for a computer program, or application, under trace. The merged symbol file contains information useful in performing symbolic resolution of address information in trace files for each instance of a module. During post processing of the trace information generated by a performance trace of a computer program, symbolic information stored in the merged symbol file is compared to the trace information stored in the trace file. The correct symbolic information in the merged symbol file for loaded modules is identified based on a number of validating criteria.

Abstract: An apparatus and method for cataloging symbolic data for use in performance analysis of computer programs is provided. The apparatus and method stores symbolic data for loaded modules during or shortly after a performance trace and utilizes the stored symbolic data when performing a performance analysis at a later time. A merged symbol file is generated for a computer program, or application, under trace. The merged symbol file contains information useful in performing symbolic resolution of address information in trace files for each instance of a module. During post processing of the trace information generated by a performance trace of a computer program, symbolic information stored in the merged symbol file is compared to the trace information stored in the trace file. The correct symbolic information in the merged symbol file for loaded modules is identified based a number of validating criteria.

Abstract: A method and system for profiling a program using periodic trace sampling is provided. During the execution of the program, sample-based profiling of the executing program is performed—for a predetermined period, a profiler performs trace processing for the program, after which the profiler pauses and does not perform trace processing for a predetermined period. The periods controlling the profiler may be selected by a user, and the periods may be measured by temporal or non-temporal metrics. The profiler cycles through these periods, during which selected events are processed to generate a profile of the execution flows within the program. For each sample period, a tree data structure is generated in which nodes of the tree data structure represent the routines of the program that execute during the sample period, as may be indicated by entry and exit events caused by the execution of the routines.

Abstract: A method and system for compensating for instrumentation overhead in trace data is provided. To profile a program, the program is executed to generate trace records that are written to a trace file. A set of event trace records in a trace file is processed to determine one or more trace overhead compensation values. The trace overhead compensation values are determined by computing, for each successive pair of event trace records in the trace file, a difference between a first timestamp in a preceding event trace record and a second timestamp in a succeeding event trace record. The minimum value of all of these differences is then stored as a trace overhead compensation value representing an amount of time for instrumentation processing of an event. The one or more trace overhead compensation values are applied to the event trace records during subsequent processing of the set of event trace records.

Abstract: A method and system for compensating for instrumentation overhead in trace data by computing average minimum event times is provided. In order to profile a program, the program is executed to generate trace records that are written to a trace file. A set of trace event records are processed, and the trace events are represented as one or more nodes in a tree data structure. One or more performance statistics are stored at each node in the tree data structure, and a performance statistic at each node is processed to determine an overhead compensation value. The overhead compensation value is determined by computing a local overhead value for each node in the tree data structure. The total execution time of a routine corresponding to the event represented by the node is retrieved, and the local overhead value is computed as the average of the execution time over the number of calls to the routine and the number of calls from the routine to other routines.