Patents by Inventor Philip R. Lee
Philip R. Lee has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 10452511Abstract: Generating a performance policy for a server. A plurality of system metrics of a first server is monitored, and a benchmark for the plurality of system metrics based on the monitored plurality of system metrics is stored. The benchmark indicates desirable system metrics of the first server. An operating policy for a second server is generated from the stored benchmark. The operating policy includes desirable system metrics of the second server based on the desirable system metrics of the first server.Type: GrantFiled: April 29, 2016Date of Patent: October 22, 2019Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Michael D. Brooks, James A. Harrison, Robert C. Jones, Philip R. Lee, Catherine M. Moxey, Mayur Raja
-
Publication number: 20170315897Abstract: Generating a performance policy for a server. A plurality of system metrics of a first server is monitored, and a benchmark for the plurality of system metrics based on the monitored plurality of system metrics is stored. The benchmark indicates desirable system metrics of the first server. An operating policy for a second server is generated from the stored benchmark. The operating policy includes desirable system metrics of the second server based on the desirable system metrics of the first server.Type: ApplicationFiled: April 29, 2016Publication date: November 2, 2017Inventors: Michael D. Brooks, James A. Harrison, Robert C. Jones, Philip R. Lee, Catherine M. Moxey, Mayur Raja
-
Patent number: 9785418Abstract: A system and computer program product for developing software in which the software comprises a plurality of programs. A change to a program is received. A data structure checking procedure may then be invoked. The changed program is parsed for a reference to a data structure. Other instances of the data structure are located in other programs within the software. The referenced data structure is compared to the located other instances of the data structure. A predefined action (such as notifying a programmer or correcting the inconsistencies) is performed in response to any detected differences between the referenced data structure and the located other instances of the data structure. These steps are repeated for all data structures within the changed program.Type: GrantFiled: September 27, 2011Date of Patent: October 10, 2017Assignee: International Business Machines CorporationInventors: Stephen J. Burghard, Mark Todd, Philip R. Lee, Andrew Wright
-
Patent number: 9766865Abstract: A method for developing software in which the software comprises a plurality of programs. A change to a program is received. A data structure checking procedure may then be invoked. The changed program is parsed for a reference to a data structure. Other instances of the data structure are located in other programs within the software. The referenced data structure is compared to the located other instances of the data structure. A predefined action (such as notifying a programmer or correcting the inconsistencies) is performed in response to any detected differences between the referenced data structure and the located other instances of the data structure. These steps are repeated for all data structures within the changed program.Type: GrantFiled: February 26, 2012Date of Patent: September 19, 2017Assignee: International Business Machines CorporationInventors: Stephen J. Burghard, Mark Todd, Philip R. Lee, Andrew Wright
-
Patent number: 9069889Abstract: Performance data for a healthy system is captured and used to create benchmarks that represent behavior of the computing environment in a healthy state. Current behavior (e.g, run-time characteristics) of the computing environment are monitored in an on-going manner, and are compared to the benchmarks. When a benchmark is violated, performance data capture is dynamically and automatically enabled. Or, if performance data is already being captured, then performance data capture may be enabled for a larger subset of possible data. Optionally, performance data capture may be automatically disabled upon detecting that the current behavior of the computing environment has returned to a healthy state where benchmarks are no longer violated.Type: GrantFiled: April 9, 2013Date of Patent: June 30, 2015Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Edward A. Addison, Peggy A. DeVal, Philip R. Lee, Andrew Wright
-
Patent number: 9015006Abstract: Performance data for a healthy system is captured and used to create benchmarks that represent behavior of the computing environment in a healthy state. Current behavior (e.g, run-time characteristics) of the computing environment are monitored in an on-going manner, and are compared to the benchmarks. When a benchmark is violated, performance data capture is dynamically and automatically enabled. Or, if performance data is already being captured, then performance data capture may be enabled for a larger subset of possible data. Optionally, performance data capture may be automatically disabled upon detecting that the current behavior of the computing environment has returned to a healthy state where benchmarks are no longer violated.Type: GrantFiled: January 13, 2012Date of Patent: April 21, 2015Assignee: International Business Machines CorporationInventors: Edward A. Addison, Peggy A. DeVal, Philip R. Lee, Andrew Wright
-
Patent number: 9009537Abstract: A multithreaded computing environment for capturing diagnostic data includes initiating a trap delay component having a delay threshold in response to a monitor determining that the computing environment is in a predetermined invalid state. The multithreaded computing environment for capturing diagnostic data also includes recording, by a first thread, diagnostic data for the computing environment. The trap delay component delays the step of recording diagnostic data until the monitor determines that the predetermined invalid state has been repeated for at least one of a total count or a period corresponding to a predetermined indicator that it is a state other than a transient state of the computing environment. The transient state corresponds to a transition of the computing environment by one or more other threads from a first valid state to a second valid state.Type: GrantFiled: March 15, 2011Date of Patent: April 14, 2015Assignee: International Business Machines CorporationInventors: Edward A. Addison, Philip R. Lee, Roger G. Lewis, Andrew Wright
-
Patent number: 8739136Abstract: Identifying conflicting declared invalid runtime references of overlaid data structures of a shared memory area as declared in a program listing. The identifying includes identifying a first data structure and a first parameter list in the program listing. A first routine call and a sequential flow of execution of the first routine call through the program listing in order to write data to the shared memory area are identified. A second data structure and a second parameter list in the program listing are identified. A second routine call and a second sequential flow of execution of the second routine call through the program listing in order to write data to the shared memory area are identified. It is determined whether the second routine call is attempting to overwrite data of the first routine call with the data of the second routine call in the shared memory area.Type: GrantFiled: November 9, 2011Date of Patent: May 27, 2014Assignee: International Business Machines CorporationInventors: Edward A. Addison, Peggy A. DeVal, Philip R. Lee, Andrew Wright
-
Publication number: 20130185021Abstract: Performance data for a healthy system is captured and used to create benchmarks that represent behavior of the computing environment in a healthy state. Current behavior (e.g, run-time characteristics) of the computing environment are monitored in an on-going manner, and are compared to the benchmarks. When a benchmark is violated, performance data capture is dynamically and automatically enabled. Or, if performance data is already being captured, then performance data capture may be enabled for a larger subset of possible data. Optionally, performance data capture may be automatically disabled upon detecting that the current behavior of the computing environment has returned to a healthy state where benchmarks are no longer violated.Type: ApplicationFiled: January 13, 2012Publication date: July 18, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Edward A. Addison, Peggy A. DeVal, Philip R. Lee, Andrew Wright
-
Publication number: 20130013963Abstract: A multithreaded computing environment for capturing diagnostic data includes initiating a trap delay component having a delay threshold in response to a monitor determining that the computing environment is in a predetermined invalid state. The multithreaded computing environment for capturing diagnostic data also includes recording, by a first thread, diagnostic data for the computing environment. The trap delay component delays the step of recording diagnostic data until the monitor determines that the predetermined invalid state has been repeated for at least one of a total count or a period corresponding to a predetermined indicator that it is a state other than a transient state of the computing environment. The transient state corresponds to a transition of the computing environment by one or more other threads from a first valid state to a second valid state.Type: ApplicationFiled: March 15, 2011Publication date: January 10, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Edward A. Addison, Philip R. Lee, Roger G. Lewis, Andrew Wright
-
Publication number: 20120159457Abstract: Identifying conflicting declared invalid runtime references of overlaid data structures of a shared memory area as declared in a program listing. The identifying includes identifying a first data structure and a first parameter list in the program listing. A first routine call and a sequential flow of execution of the first routine call through the program listing in order to write data to the shared memory area are identified. A second data structure and a second parameter list in the program listing are identified. A second routine call and a second sequential flow of execution of the second routine call through the program listing in order to write data to the shared memory area are identified. It is determined whether the second routine call is attempting to overwrite data of the first routine call with the data of the second routine call in the shared memory area.Type: ApplicationFiled: November 9, 2011Publication date: June 21, 2012Applicant: International Business Machines CorporationInventors: Edward A. Addison, Peggy A. DeVal, Philip R. Lee, Andrew Wright
-
Publication number: 20120159440Abstract: A method for developing software in which the software comprises a plurality of programs. A change to a program is received. A data structure checking procedure may then be invoked. The changed program is parsed for a reference to a data structure. Other instances of the data structure are located in other programs within the software. The referenced data structure is compared to the located other instances of the data structure. A predefined action (such as notifying a programmer or correcting the inconsistencies) is performed in response to any detected differences between the referenced data structure and the located other instances of the data structure. These steps are repeated for all data structures within the changed program.Type: ApplicationFiled: February 26, 2012Publication date: June 21, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Stephen J. Burghard, Mark Todd, Philip R. Lee, Andrew Wright
-
Publication number: 20120102454Abstract: A method, system and computer program product for developing software in which the software comprises a plurality of programs. A change to a program is received. A data structure checking procedure may then be invoked. The changed program is parsed for a reference to a data structure. Other instances of the data structure are located in other programs within the software. The referenced data structure is compared to the located other instances of the data structure. A predefined action (such as notifying a programmer or correcting the inconsistencies) is performed in response to any detected differences between the referenced data structure and the located other instances of the data structure. These steps are repeated for all data structures within the changed program.Type: ApplicationFiled: September 27, 2011Publication date: April 26, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Stephen J. Burghard, Mark Todd, Philip R. Lee, Andrew Wright