EP0422945A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Parallel processing trace data manipulation
Assignee: International Business Machines Corp
•
Filing: 1990-10-11
•
Granted: —
•
Expires: 2010-10-11
Abstract
Abstract A computer implemented system by which trace data from concurrently executing virtual processors is reformatted and organized as a linked list of successive events evoking parallel activity for any given parallel task. A selective traverse of the links operates to drive time process displays of processor utilization and the executing hierarchy of parallel constructs. <IMAGE>
Inventors
- 👤 Charles Andrew Luke
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-04 17:35
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/36; G06F11/3698; G06F11/30; G06F11/32; G06F11/323; G06F11/34; G06F11/3404; G06F11/362; G06F11/3636; G06F11/3409; G06F11/3419; G06F11/3466; G06F2201/00; G06F2201/86; Y; Y10; Y10S; Y10S715/00; Y10S715/961; Y10S715/963
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
77 words
A method for converting computer trace data into graphical form, said trace data being obtained from concurrently executing virtual processors, comprising the steps of: (a) reformatting said trace data into a linked list of successive events evoking parallel activity for any given parallel task; and (b) selectively traversing the links of said list to produce time process display of processor utilization and any executing hierarchy of parallel activity constructs, said displays being in synchronism with said traversal.
Claim 2
Independent Claim
77 words
A method for converting computer trace data into graphical form, said trace data being obtained from concurrently executing virtual processors, comprising the steps of: (a) reformatting said trace data into a linked list of successive events evoking parallel activity for any given parallel task; and (b) selectively traversing the links of said list to produce time process display of processor utilization and any executing hierarchy of parallel activity constructs, said displays being in synchronism with said traversal.
Claim 3
Independent Claim
111 words
A method for converting computer trace data into graphical form, said trace data being generated by operating system dispatchers indicative of the concurrent execution of tasks of an application upon one or more virtual processors, comprising the steps of: (a) forming a table (33,35;31′) from the trace data (31;31′) identifying and cross-linking the virtual processor, task ID, parallel activity, and one or more parallel activity metrics for each trace data event; and (b) graphically mapping the table elements onto a display (1) as indexed by the processor and activity crosslinks for processor utilization 67-93; and (2)as indexed by the task and activity crosslinks for the executing hierarchy of parallel tasks (99-119).
Claim 4
Independent Claim
111 words
A method for converting computer trace data into graphical form, said trace data being generated by operating system dispatchers indicative of the concurrent execution of tasks of an application upon one or more virtual processors, comprising the steps of: (a) forming a table (33,35;31′) from the trace data (31;31′) identifying and cross-linking the virtual processor, task ID, parallel activity, and one or more parallel activity metrics for each trace data event; and (b) graphically mapping the table elements onto a display (1) as indexed by the processor and activity crosslinks for processor utilization 67-93; and (2)as indexed by the task and activity crosslinks for the executing hierarchy of parallel tasks (99-119).
Claim 5
Dependent Claim
60 words
A method as claimed in claim 2, wherein steps (a) and (b) respectively include the steps of (a1) deriving a concordance (35) of task ID and parallel activities as sorted on the task ID; and (b1) accessing the table by way of the concordance in the mapping of table elements onto the display of executing the hierarchy of parallel tasks.
Claim 6
Independent Claim
43 words
A method as claimed in any of claims 2 or 3, wherein the step of graphically mapping the table elements onto a display includes invoking a graphics data display utility to colour the display as indexed by selected processor, task ID, and activity.
Claim 7
Independent Claim
115 words
A method as claimed in any of claims 2, 3 or 4, wherein the displays include a time process diagram depicting virtual processor utilization, said mapping step including processing said table once for each virtual processor ID, each time process diagram being susceptible to a zoom forward, and backward view expressed as a time range or interval, and said mapping step further including the steps of expressing parallel activity in the form of primary and secondary threads, comparing the beginning and end times for each primary thread to the time range of the selected view (Tmin, Tmax), and selectively adjusting the view to conform the thread activity to the diagram time range to enhance visibility.
Claim 8
Independent Claim
116 words
A method for processing and displaying information about the parallel execution of an application program (21-23) across N virtual processors (15-19) as derived from computer trace records (31;31′), said trace records being generated by dispatching functions embedded in either the application or operating system, comprising the steps of: (a) ascertaining and identifying parallel activity by scanning the trace records generated by said processors; (b) creating and populating a table (33,35;33′) of time sequence events from the identified parallel activity, computing average concurrency, and cross-linking the terms of the table (34;34′); and (c) extracting data from the table as indexed by a selected subset of crosslinks and graphically mapping said extracted data onto a visually perceptible medium.
Claim 9
Independent Claim
116 words
A method for processing and displaying information about the parallel execution of an application program (21-23) across N virtual processors (15-19) as derived from computer trace records (31;31′), said trace records being generated by dispatching functions embedded in either the application or operating system, comprising the steps of: (a) ascertaining and identifying parallel activity by scanning the trace records generated by said processors; (b) creating and populating a table (33,35;33′) of time sequence events from the identified parallel activity, computing average concurrency, and cross-linking the terms of the table (34;34′); and (c) extracting data from the table as indexed by a selected subset of crosslinks and graphically mapping said extracted data onto a visually perceptible medium.
Claim 10
Dependent Claim
58 words
A data processing apparatus having storage for storing computer trace data obtained from concurrently executing threads of a program, and processor logic for reformatting said trace data into a linked list of events initiating and terminating parallel executing threads and for traversing the links of said list to produce a display indicative of the performance of said program.
Claim 11
Dependent Claim
58 words
A data processing apparatus having storage for storing computer trace data obtained from concurrently executing threads of a program, and processor logic for reformatting said trace data into a linked list of events initiating and terminating parallel executing threads and for traversing the links of said list to produce a display indicative of the performance of said program.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.