AUTOMATED GROUPING OF MESSAGES PROVIDED TO AN APPLICATION USING EXECUTION PATH SIMILARITY ANALYSIS
First Claim
1. A computer-implemented method for characterizing execution paths, comprising:
- identifying execution paths of at least one application, the execution paths are responsive to receipt by the at least one application of messages;
responsive to the identifying, calculating metrics which represent distances between the execution paths;
grouping the execution paths according to the metrics into a plurality of groups of execution paths; and
responsive to the grouping of the execution paths, grouping the messages into a plurality of groups of messages.
2 Assignments
0 Petitions
Accused Products
Abstract
An application is monitored to identify different execution paths, e.g., sequences of invoked components, which occur due to the receipt of messages by the application. Similarities between the execution paths are determined based on a distance algorithm, in one approach, and execution paths which are similar are assigned to a common group. Additionally, application runtime data such as response times is obtained for the execution paths and aggregated for the group. The messages can also be grouped based on the grouping of the execution paths. Further, a representative execution path can be determined for each execution path group for comparison to subsequent execution paths. A representative message can similarly be determined for each message group. Results can be reported which include a group identifier, representative message, representative execution path, count, and aggregated runtime data.
-
Citations
40 Claims
-
1. A computer-implemented method for characterizing execution paths, comprising:
-
identifying execution paths of at least one application, the execution paths are responsive to receipt by the at least one application of messages; responsive to the identifying, calculating metrics which represent distances between the execution paths; grouping the execution paths according to the metrics into a plurality of groups of execution paths; and responsive to the grouping of the execution paths, grouping the messages into a plurality of groups of messages. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14)
-
-
15. A computer-implemented method for characterizing execution paths, comprising:
-
identifying an execution path of at least one application, the execution path is responsive to receipt by the at least one application of a message; responsive to the identifying, calculating metrics which represent distances between the identified execution path and representative execution paths of each of a plurality of groups of execution paths; grouping the identified execution path into one of the plurality of groups of execution paths for which the metric indicates a minimum distance; and responsive to the grouping of the identified execution path, grouping the message into one of a plurality of groups of messages. - View Dependent Claims (16, 17, 18, 19, 20, 21, 22, 23)
-
-
24. A computer-implemented method for characterizing execution paths, comprising:
-
identifying an execution path of at least one application, the execution path is responsive to receipt by the at least one application of a message; responsive to the identifying, calculating metrics which represent distances between the identified execution path and representative execution paths of each of a plurality of groups of execution paths, one of the metrics representing a minimum distance; if the metric which represents the minimum distance exceeds a threshold, grouping the identified execution path into a new execution path group; and if the metric which represents the minimum distance does not exceed the threshold, grouping the identified execution path into one of the plurality of groups of execution paths for which the metric indicates the minimum distance. - View Dependent Claims (25, 26)
-
-
27. At least one processor readable storage device having processor readable code embodied thereon for programming at least one processor to perform a method, the method comprising:
-
identifying execution paths of at least one application, the execution paths are responsive to receipt by the at least one application of messages; responsive to the identifying, calculating metrics which represent distances between the execution paths; grouping the execution paths according to the metrics into a plurality of groups of execution paths; and responsive to the grouping of the execution paths, grouping the messages into a plurality of groups of messages. - View Dependent Claims (28, 29, 30, 31, 32, 33)
-
-
34. At least one processor readable storage device having processor readable code embodied thereon for programming at least one processor to perform a method, the method comprising:
-
identifying an execution path of at least one application, the execution path is responsive to receipt by the at least one application of a message; responsive to the identifying, calculating metrics which represent distances between the identified execution path and representative execution paths of each of a plurality of groups of execution paths; grouping the identified execution path into one of the plurality of groups of execution paths for which the metric indicates a minimum distance; and responsive to the grouping of the identified execution path, grouping the message into one of a plurality of groups of messages. - View Dependent Claims (35, 36, 37)
-
-
38. At least one processor readable storage device having processor readable code embodied thereon for programming at least one processor to perform a method, the method comprising:
-
identifying an execution path of at least one application, the execution path is responsive to receipt by the at least one application of a message; responsive to the identifying, calculating metrics which represent distances between the identified execution path and representative execution paths of each of a plurality of groups of execution paths, one of the metrics representing a minimum distance; if the metric which represents the minimum distance exceeds a threshold, grouping the identified execution path into a new execution path group; and if the metric which represents the minimum distance does not exceed the threshold, grouping the identified execution path into one of the plurality of groups of execution paths for which the metric indicates the minimum distance. - View Dependent Claims (39, 40)
-
Specification