The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Apr. 14, 2009

Filed:

Feb. 12, 2004
Applicants:

William Preston Alexander, Iii, Austin, TX (US);

Robert Tod Dimpsey, Austin, TX (US);

Frank Eliot Levine, Austin, TX (US);

Robert John Urquhart, Austin, TX (US);

Inventors:

William Preston Alexander, III, Austin, TX (US);

Robert Tod Dimpsey, Austin, TX (US);

Frank Eliot Levine, Austin, TX (US);

Robert John Urquhart, Austin, TX (US);

Attorneys:
Primary Examiner:
Int. Cl.
CPC ...
G06F 9/44 (2006.01); G06F 11/30 (2006.01); G06F 11/36 (2006.01);
U.S. Cl.
CPC ...
Abstract

A method and apparatus for averaging out variations from run to run of a computer program are provided. With the apparatus and method, call trees are generated for two or more executions of a build of a computer program. The apparatus and method perform a 'tree-addition' operation in which the two or more call trees generated during runs of the computer program are added to one another to thereby accumulate statistics for each call in the call trees. These statistics may then be divided by the number of runs whose tree data structures are being accumulated. In this way, an average of the tree data structures is generated. In addition, any portions of the tree data structure that are due to asynchronous events are averaged out so that their relative affect in the resulting tree data structure is minimized.


Find Patent Forward Citations

Loading…