Call Graph Simplification/Comparison and Automatic Initial Suspects Finding of Performance Degradations
AssigneeSap SE
InventorsCheolman Park, Chan Young
Life of this patent
Estimating the term…
Loading patent…
AssigneeSap SE
InventorsCheolman Park, Chan Young
Estimating the term…
In one embodiment, a method for call graph analysis is provided. The method includes determining a plurality of nodes in a call graph. The plurality of nodes represent resource consumption of functions of a software program executed in a software system. A simplification factor is determined. A first set of nodes in the plurality of nodes is then eliminated based on exclusive values for the plurality of nodes, inclusive values for the plurality of nodes, and the simplification factor. An inclusive value for a node is a first amount of resources consumed by the node and any descendent nodes of that node. An exclusive value for the node is a second amount of resources consumed by the node. A simplified call graph is output including a second set of nodes in the plurality of nodes. The second set of nodes does not include the eliminated first set of nodes.
A method comprising:
A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions for:
A computer implemented system, comprising:
Dependencies are inferred from the claim text.