Robert F Berry

Address:

2011 Lakeway Blvd, Lakeway, TX 78734

Phone:

(512)2613253

VIN:

1GNES13M872188308

Make:

CHEVROLET

Model:

TRAILBLAZER

Year:

2007

US Patent:

6338159, Jan 8, 2002

Filed:

Jun 30, 1999

Appl. No.:

09/343424

Inventors:

Robert Francis Berry - Austin TX
Riaz Y. Hussain - Austin TX
Frank Eliot Levine - Austin TX
Robert John Urquhart - Austin TX

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 944

US Classification:

717 4, 702179, 702186, 707206, 710 56

Abstract:

The present invention is a system, method, and computer readable medium for representing program event trace information in a way which is very compact and efficient, and yet supports a wide variety of queries regarding system performance. The tracing and reduction of the present invention may be dynamic, in which case information is obtained and added to the trace representation in real-time. Alternately, the tracing and reduction may be static, in which case a trace text file or binary file is obtained from a trace buffer, and the reduction takes place using the trace file as input. The trace information, whether obtained statically or dynamically, is represented as a tree of events. The present invention may be used to present many types of trace information in a compact manner which supports performance queries. For example, the tree structure of the present invention may reflect the call stacks observed during a programs execution, and statistics regarding the memory allocated/deallocated in the various routines and call stacks may be stored at each node of the tree. The tree structure may be used to store performance information regarding Java bytecodes executed, memory allocated, or other types of performance information.

US Patent:

6381558, Apr 30, 2002

Filed:

Dec 18, 1998

Appl. No.:

09/213140

Inventors:

Robert Francis Berry - Austin TX
Rangarajan Thiruvenkata Chari - Austin TX
Riaz Yousuf Hussain - Austin TX
Robert John Urguhart - Austin TX

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 1130

US Classification:

702186, 714 38, 717 4

Abstract:

Understanding a third-party vendors benchmark can be difficult when its source code is proprietary. In particular, the factors on which the benchmarks score depend can not easily be discovered. Furthermore, the sensitivity of the score to the execution speed of various components of the benchmark, which is important for optimizing the score in a competitive environment, is not readily accessible. The present invention shows how insertion of known delays into selected components of a benchmark can be used to elucidate its computational structure, profile it, find the sensitivity of its score to the time spent in a functional component. In all these uses of the present invention, execution of a predetermined amount of code is used to introduce a known delay into a target function or Java method. The benchmark is then re-executed to determine the delays impact on the benchmarks score. Varying the number of iterations of the delay code, and varying the method or function in which it is inserted, are used to achieve different purposes.

US Patent:

6434575, Aug 13, 2002

Filed:

Nov 12, 1998

Appl. No.:

09/190562

Inventors:

Robert Francis Berry - Austin TX
Raymond M. Bryant - Austin TX
Weiming Gu - Austin TX
John Day Howard - Austin TX
William Robert Reynolds - Austin TX
Robert J. Urquhart - Austin TX

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 1200

US Classification:

707206, 707101, 707103, 717148, 717154

Abstract:

A method and apparatus for instrumenting garbage collection in a data processing system is provided. During garbage collection, a pass is made through the object heap and a plurality of heap data is retrieved and written to a trace file. The data may include the type of object, the size of the object on the heap, the class of the object, if appropriate, and a plurality of pointers, including live set pointers, and one or more tags representing attributes that may be associated with the particular object. The instrumentation may controlled to occur at a preselected phase of the garbage collection process. Additionally, a user may dynamically initiate a garbage collection instrumentation if the user determines that an event has occurred during the operation of the data processing system about which the user wishes further data.

US Patent:

6513155, Jan 28, 2003

Filed:

Jun 30, 1999

Appl. No.:

09/343438

Inventors:

Robert Francis Berry - Austin TX
Frank Eliot Levine - Austin TX
Robert John Urquhart - Austin TX

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 1730

US Classification:

717124

Abstract:

A process and system for profiling code executing on a data processing system is provided. Event-based trace data is recorded in response to selected events, and the event-based trace data includes an indication which code is being interrupted. The trace data may be processed to identify a thread or method that was executing during the event. A periodically occurring event is also detected, and a call stack associated with the profiled code is identified in response to detection of the periodically occurring event, such as a timer interrupt. The call stack is examined to identify each routine that is currently executing during the periodically occurring event, and the trace data is recorded with the call stack information. The trace data from the recorded events and the trace data from the call stacks are processed to generate a tree structure in which the nodes indicate the call structure of the routine information from both the trace events and the call stacks.

US Patent:

6539339, Mar 25, 2003

Filed:

Sep 9, 1999

Appl. No.:

09/393087

Inventors:

Robert Francis Berry - Austin TX
Ronald ONeal Edmark - Austin TX
Frank Eliot Levine - Austin TX
Robert J. Urquhart - Austin TX

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 1100

US Classification:

702186, 702183, 702182, 702187, 714 38, 717130

Abstract:

A method and system for maintaining a thread-relative metric for trace data using device driver support is provided. A profiling process may detect a current event, and in response to the current event, may request an elapsed metric since a preceding event. The profiling process then receives a thread-relative elapsed metric and may output a trace record for the current event in which is stored a metric equal to the received thread-relative elapsed metric. In response to a notification of an occurrence of the current event, a device driver computes the thread-relative elapsed metric by: determining a current thread; retrieving a stored metric for the preceding event of the current thread; obtaining a current metric; and computing the thread-relative elapsed metric as a difference between the current metric and the stored metric.

US Patent:

6546548, Apr 8, 2003

Filed:

Oct 7, 1999

Appl. No.:

09/414346

Inventors:

Robert Francis Berry - Austin TX
Jesse Mannes Gordon - Austin TX
Riaz Y. Hussain - Austin TX
Frank Eliot Levine - Austin TX
Robert J. Urquhart - Austin TX

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 945

US Classification:

717128

Abstract:

A method and system for compensating for trace overhead is provided by analyzing and compensating for the temporal overhead associated with generating or outputting trace information to a trace buffer or a trace file in the form of trace records. A trace record generally represents an occurrence of a profiling event of interest. The amount of time required to generate a trace record may be determined, and the trace times retrieved from the trace records are adjusted to compensate for the amount of time required to generate those trace records. A trace overhead calibration value may be determined by computing the average time necessary to generate a trace record, or in certain cases, by computing the minimum time necessary to generate a trace record. The trace overhead calibration value is stored for subsequent use in a profiling-related process in the data processing system.

US Patent:

6553564, Apr 22, 2003

Filed:

Jun 30, 1999

Appl. No.:

09/343439

Inventors:

Robert Francis Berry - Austin TX
Frank Eliot Levine - Austin TX
Robert John Urquhart - Austin TX

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 944

US Classification:

717128, 717124, 717127, 717129, 717130

Abstract:

A process and system for profiling code executing on a data processing system is provided. Event-based trace data is recorded in response to selected events, and the event-based trace data includes an indication of which code is being interrupted. The trace data may be processed to identify a thread or method that was executing during the event. A periodically occurring event is also detected, and a stack associated with the profiled code is identified in response to detection of the periodically occurring event, such as a timer interrupt. The stack is examined to identify each routine that is currently executing during the periodically occurring event.

US Patent:

6598012, Jul 22, 2003

Filed:

Oct 7, 1999

Appl. No.:

09/414344

Inventors:

Robert Francis Berry - Austin TX
Jesse Mannes Gordon - Austin TX
Riaz Y. Hussain - Austin TX
Frank Eliot Levine - Austin TX
Robert J. Urquhart - Austin TX

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 1500

US Classification:

702187, 717130

Abstract:

A method and system for compensating for output overhead in trace data is provided by analyzing and compensating for the overhead associated with outputting trace information to a trace buffer or a trace file in the form of trace records. A trace record represents an occurrence of some profiling event of interest. Each trace record contains a starting timestamp representing the time at which the generation of the trace record was commenced and an ending timestamp representing the time at which the generation of the trace record was completed. In order to compute the period of execution time attributable to the application program or system being profiled, a starting timestamp of a trace record is compared with the ending timestamp of a preceding trace record, and the difference between the timestamps is directly related to the execution time of the application program or system being profiled. The time period between the timestamps in a trace record is implicitly disregarded as attributable to overhead in the generation of trace records.