US6002872A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for structured profiling of data processing systems and applications
Assignee: International Business Machines Corp
•
Filing: 1998-03-31
•
Granted: 1999-12-14
•
Expires: 2018-03-31
Abstract
Abstract A method for monitoring performance of a program. A periodically occurring event is detected and a stack associated with the program is identified in response to a detection of the periodically occurring event, which may be a timer interrupt. The stack is examined to identify each routine (and specific invocation point, or offset) that is currently executing in association with the program. Each routine (and offset) is represented as a node in a tree structure.
Inventors
- 👤 William Preston Alexander, III
- 👤 Robert Francis Berry
- 👤 Donald L. Mulvey
- 👤 Robert John Urquhart
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 23:23
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/28; G06F11/36; G06F11/3604; G06F11/3612; G06F11/30; G06F11/34; G06F11/3466; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933
Claims Analysis
Total Claims: 26
Claim 1
Independent Claim
62 words
A method for monitoring performance of a program, the method comprising: detecting an occurrence of a selected event; identifying a call stack associated with the program in response to a detection of the selected event; examining the call stack to identify each routine that is currently executing in association with the program; and representing each routine as a node in tree structure.
Claim 2
Independent Claim
62 words
A method for monitoring performance of a program, the method comprising: detecting an occurrence of a selected event; identifying a call stack associated with the program in response to a detection of the selected event; examining the call stack to identify each routine that is currently executing in association with the program; and representing each routine as a node in tree structure.
Claim 3
Dependent Claim
23 words
The method of claim 1 further comprising: associating information relating to execution of each routine with a node used to represent the routine.
Claim 4
Dependent Claim
16 words
The method of claim 1, wherein the information relating to execution comprises function name plus offset.
Claim 5
Dependent Claim
15 words
The method of claim 1 further comprising: creating a report identifying each routing currently executing.
Claim 6
Dependent Claim
18 words
The method of claim 4, wherein the step of creating occurs each time a call stack is examined.
Claim 7
Dependent Claim
18 words
The method of claim 4, wherein the step of creating occurs after execution of the program is terminated.
Claim 8
Dependent Claim
16 words
The method of claim 4, wherein the report is in a format of a tree structure.
Claim 9
Dependent Claim
12 words
The method of claim 1, wherein the selected is an event timer.
Claim 10
Dependent Claim
89 words
The method of claim 1, wherein the step of examining the call stack comprises: reading the call stack, wherein the call stack is a list of routines being executed when the periodically occurring event occurs; determining whether a selected routine is found within the tree structure; and adding a new node to the tree structure for the address in response to a determination that the selected routine is absent from the tree structure, wherein the new node is a child node descending from a parent node representing another address.
Claim 11
Dependent Claim
33 words
The method of claim 9, wherein the list of routines is a plurality of addresses, wherein each address within the plurality of addresses identifies an entry point, or other offset within a routine.
Claim 12
Dependent Claim
74 words
A data processing system for monitoring performance of a program, the data processing system comprising: detection means for detecting selected event; identification means for identifying a call stack associated with the program in response to a detection of the selected event; examination means for examining the call stack to identify each routine that is currently executing in association with the program; and representation means for representing each routine as a node in tree structure.
Claim 13
Dependent Claim
74 words
A data processing system for monitoring performance of a program, the data processing system comprising: detection means for detecting selected event; identification means for identifying a call stack associated with the program in response to a detection of the selected event; examination means for examining the call stack to identify each routine that is currently executing in association with the program; and representation means for representing each routine as a node in tree structure.
Claim 14
Dependent Claim
28 words
The data processing system of claim 11 further comprising: association means for associating information relating to execution of each routine with a node used to represent the routine.
Claim 15
Dependent Claim
20 words
The data processing system of claim 11 further comprising: creation means for creating a report identifying each routing currently executing.
Claim 16
Dependent Claim
20 words
The data processing system of claim 13, wherein the creation means is activated each time a call stack is examined.
Claim 17
Dependent Claim
20 words
The data processing system of claim 13, wherein the creation means is activated after execution of the program is terminated.
Claim 18
Dependent Claim
18 words
The data processing system of claim 13, wherein the report is in a format of a tree structure.
Claim 19
Dependent Claim
15 words
The data processing system of claim 11, wherein the selected event is an event timer.
Claim 20
Dependent Claim
32 words
The data processing system of claim 17, wherein the list of routines is a plurality of addresses, wherein each address within the plurality of addresses identifies an entry point for a routine.
Claim 21
Dependent Claim
96 words
The data processing system of claim 11, wherein the examination means comprises: reading means for reading the call stack, wherein the call stack is a list of routines being executed when the periodically occurring event occurs; determination means for determining whether a selected routine is found within the tree structure; and addition means for adding a new node to the tree structure for the address in response to a determination that the selected routine is absent from the tree structure, wherein the new node is a child node descending from a parent node representing another address.
Claim 22
Dependent Claim
84 words
A computer program product for use with a data processing system for monitoring performance of a program, the computer program product comprising: first instructions for detecting a periodically occurring event; second instructions for identifying a call stack associated with the program in response to a detection of the periodically occurring event; third instructions for examining the call stack to identify each routine that is currently executing in association with the program; and fourth instructions for representing each routine as a node in tree structure.
Claim 23
Dependent Claim
84 words
A computer program product for use with a data processing system for monitoring performance of a program, the computer program product comprising: first instructions for detecting a periodically occurring event; second instructions for identifying a call stack associated with the program in response to a detection of the periodically occurring event; third instructions for examining the call stack to identify each routine that is currently executing in association with the program; and fourth instructions for representing each routine as a node in tree structure.
Claim 24
Dependent Claim
28 words
The computer program product of claim 20, further comprising: fifth instructions for associating information relating to execution of each routine with a node used to represent the routine.
Claim 25
Dependent Claim
20 words
The computer program product of claim 20, further comprising: fifth instructions for creating a report identifying each routine currently executing.
Claim 26
Dependent Claim
98 words
The computer program product of claim 20, wherein the third instructions for examining the call stack comprises: instructions for reading the call stack, wherein the call stack is a list of routines being executed when the periodically occurring event occurs; instructions for determining whether a selected routine is found within the tree structure; and instructions for adding a new node to the tree structure for the address in response to a determination that the selected routine is absent from the tree structure, wherein the new node is a child node descending from a parent node representing another address.
References Cited (Backward Citations)
US3916387A
Cited
US5355487A
Cited
US5774729A
Cited
US5828883A
Cited
US5732272A
Cited
US5696701A
Cited
US5889993A
Cited
US5911060A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-12-13 | 2003-06-14 | 2003-12-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-12-13 | 2007-06-14 | 2007-12-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-12-13 | 2011-06-14 | 2011-12-14 | $7700.00 | Window Closed / Lapsed |