Patent ID: 8473928

Claim:
A method comprising: determining a plurality of nodes in a call graph, the plurality of nodes representing resource consumption of functions of a software program executed in a software system; determining a simplification factor; eliminating, by a computing device, a first set of nodes in the plurality of nodes based on exclusive values for the plurality of nodes, inclusive values for the plurality of nodes, and the simplification factor, wherein an inclusive value for a node is based on a first amount of resources consumed by the node and any descendant nodes to the node, and wherein an exclusive value for the node is based on a second amount of resources consumed by the node, said eliminating comprising: determining the node with a lowest inclusive value out of nodes not eliminated; eliminating the node when a criteria is satisfied; adding an exclusive value for the node to a total exclusive value of eliminated nodes; and determining when to stop eliminating nodes based on the total exclusive value of eliminated nodes and the simplification factor; and outputting a simplified call graph including a second set of nodes in the plurality of nodes, the second set of nodes not including the eliminated first set of nodes.