Patents by Inventor Curtis E Hrischuk
Curtis E Hrischuk 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).
-
Publication number: 20090138237Abstract: A method of determining accuracy of predicted system behavior can include creating a plurality of noise adjusted analytical models, wherein each noise adjusted analytical model is associated with a set of predefined analytical model parameters. A set of inferred analytical model parameters for each noise adjusted analytical model can be derived. Each set of inferred analytical model parameters can depend upon a current noise adjusted analytical model and each prior noise adjusted analytical model. For each set of inferred analytical model parameters, a measure of error between the set of inferred analytical model parameters and the set of predefined analytical model parameters associated with the noise adjusted analytical model from which the set of inferred analytical model parameters was derived can be determined.Type: ApplicationFiled: December 24, 2008Publication date: May 28, 2009Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Curtis E. Hrischuk, Ed Emil Huth, Dazhi Wang, Li Zhang
-
Publication number: 20090122705Abstract: A method, system and computer program product for managing bursts of traffic. A counter, referred to herein as a “frequency counter,” is incremented during those time intervals an overload condition is detected and is decremented during those time intervals an overload condition is not detected. An overload condition may refer to when the number of out-of-dialog messages exceeds a threshold value corresponding to the maximum number of out-of-dialog messages that should be accepted and forwarded to an associated session server. If the count of the frequency counter exceeds some pre-configured value, then traffic that exceeds the threshold for the overload condition is stopped from being sent to the associated session server. Otherwise, traffic that exceeds the threshold for the overload condition is permitted to be sent to the associated session server. By managing bursts of traffic in such a manner, the effective utilization of session servers is improved.Type: ApplicationFiled: November 9, 2007Publication date: May 14, 2009Applicant: International Business Machines CorporationInventors: Gary John DeVal, Curtis E. Hrischuk, Mark Johnson, Craig Andrew Lanzen, James Winston Lawwill, JR., Timothy Paul Pickett, Brian Pulito
-
Publication number: 20090122704Abstract: A method, system and computer program product for limiting extreme loads and reducing fluctuations in load at session servers. An admission rate controller of a SIP router calculates the “deflator ratio” equal to the average number of in-dialog messages received over a first fixed interval of time divided by the average number of out-of-dialog messages received over a second fixed interval of time. Further, the admission rate controller calculates the “dampening ratio” equal to the maximum number of messages allowed over a period of time divided by the number of messages admitted over a previous time interval. When an overload condition has been detected, the admission rate controller calculates the maximum number of out-of-dialog messages to be sent to its associated SIP server based on the deflator and dampening ratios. In this manner, a smoother transition from the overload condition to the non-overload condition may occur.Type: ApplicationFiled: November 9, 2007Publication date: May 14, 2009Applicant: International Business Machines CorporationInventors: Gary John DeVal, Curtis E. Hrischuk, Mark Johnson, Craig Andrew Lanzen, James Winston Lawwill, JR., Timothy Paul Pickett, Brian Pulito
-
Publication number: 20090112952Abstract: A solution for handling objects in a nursery heap that includes a garbage collector monitoring engine, a size adjustor program, and/or a promotion program. The garbage collector monitoring engine can monitor occurrences of global garbage collection events performed by a global garbage collector program as well as occurrences of nursery garbage collection events performed by a nursery garbage collector. The size adjustor program can dynamically adjust a size of a nursery heap based upon programmatically deterministic events detected by the garbage collector monitoring engine. The promotion program can dynamically adjust conditions of promotion for nursery objects, wherein when additional space is needed in the nursery heap to reduce nursery garbage collection induced latency, the promotion program changes promotion criteria to ensure objects are promoted more frequently from the nursery heap.Type: ApplicationFiled: October 30, 2007Publication date: April 30, 2009Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: HENRY W. ADAMS, III, CURTIS E. HRISCHUK, RYAN A. SCIAMPACONE
-
Patent number: 7512519Abstract: A method of determining accuracy of predicted system behavior can include creating a plurality of noise adjusted analytical models, wherein each noise adjusted analytical model is associated with a set of predefined analytical model parameters. A set of inferred analytical model parameters for each noise adjusted analytical model can be derived. Each set of inferred analytical model parameters can depend upon a current noise adjusted analytical model and each prior noise adjusted analytical model. For each set of inferred analytical model parameters, a measure of error between the set of inferred analytical model parameters and the set of predefined analytical model parameters associated with the noise adjusted analytical model from which the set of inferred analytical model parameters was derived can be determined.Type: GrantFiled: November 24, 2006Date of Patent: March 31, 2009Assignee: International Business Machines CorporationInventors: Curtis E. Hrischuk, Edward Emil Huth, Dazhi Wang, Li Zhang
-
Publication number: 20090063594Abstract: The number of CPU cycles required to reclaim object memory space in a memory management process is reduced by using a two phase approach. A data structure exists for each object that is to be loaded into object memory space. One part of the data structure is the object definition. The other part is a MM (Memory Management) immunity annotation or value that controls the frequency with which the object must actually be examined to determine if it is suitable for reclamation. On each iteration of the memory management process, the object's MM immunity value is tested to determine whether it is greater than a predetermined threshold. If greater than the threshold, the value is decremented, but the object is not actually examined for its suitability for removal. If the value equals the threshold, the object itself is examined.Type: ApplicationFiled: August 29, 2007Publication date: March 5, 2009Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Gary John DeVal, Michael Stephen Fulton, Curtis E. Hrischuk, Ryan Andrew Sciampacone
-
Publication number: 20090055615Abstract: A method, system and computer program product for garbage collection sensitive load balancing is disclosed. The method for memory tuning for garbage collection and CPU utilization optimization can include benchmarking an application across multiple different heap sizes to accumulate garbage collection metrics and utilizing the garbage collection metrics accumulated during benchmarking to compute both CPU utilization and garbage collection time for each of a selection of candidate heap sizes. One of the candidate heap sizes can be matched to a desired CPU utilization and garbage collection time, and the matched one of the candidate heap sizes can be applied to a host environment.Type: ApplicationFiled: October 27, 2008Publication date: February 26, 2009Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Thomas E. Creamer, Curtis E. Hrischuk
-
Patent number: 7467278Abstract: A method and computer program product for garbage collection sensitive load balancing is disclosed for memory tuning for garbage collection and CPU utilization optimization An application is benchmarked across multiple different heap sizes to accumulate garbage collection metrics and the garbage collection metrics accumulated during benchmarking are utilized to compute both CPU utilization and garbage collection time for each of a selection of candidate heap sizes. One of the candidate heap sizes can be matched to a desired CPU utilization and garbage collection time, and the matched one of the candidate heap sizes can be applied to a host environment.Type: GrantFiled: May 8, 2006Date of Patent: December 16, 2008Assignee: International Business Machines CorporationInventors: Thomas E Creamer, Curtis E Hrischuk
-
Publication number: 20080307183Abstract: The present invention manages the execution of multiple AMM cycles to reduce or eliminate any overlap. Specifically, the present invention provides an external supervisory process to monitor the AMM behavior of VMs on one or more nodes, and intervene when coincident AMM activity appears to be imminent. If AMM patterns suggest that two VMs are likely to perform a (e.g., a major) AMM cycle simultaneously (or with significant overlap) in the near future, the supervisory process can trigger one of the VMs to AMM immediately, or at the first ‘safe’ interval prior to the predicted AMM collision. This will have the effect of desynchronizing the AMM behavior of the VMs and maintaining AMM latency for both VMs within the expected bounds for their independent operation, without any inter-VM effects.Type: ApplicationFiled: June 11, 2007Publication date: December 11, 2008Inventors: Gary J. DeVal, Curtis E. Hrischuk
-
Publication number: 20080239960Abstract: An improved solution for managing messages through a request response protocol network utilizing a path-based adaptive prioritization and latency management is provided. In an embodiment of the invention, a method of managing a message being conveyed through a request response protocol network via a path includes: receiving the message; determining for the message at least one of: an incoming portion of the path or an outgoing portion of the path; and adjusting a priority of the message based on a latency target for the determined portion of the path.Type: ApplicationFiled: March 30, 2007Publication date: October 2, 2008Inventors: Erik J. Burckart, John P. Cammarata, Curtis E. Hrischuk, Michael J. Spreitzer
-
Publication number: 20080162709Abstract: A system for processing application protocol requests is disclosed. An apparatus that incorporates teachings of the present disclosure may include, for example, an Application Protocol Assignment System having a controller element that assigns each of one or more application protocol requests to a select one or more of a plurality of application servers according to a memory utilization of each of the plurality of application servers. Additional embodiments are disclosed.Type: ApplicationFiled: December 27, 2006Publication date: July 3, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: CURTIS E. HRISCHUK, Gary J. Deval, Michael J. Spreitzer, Jin Feng Hu
-
Publication number: 20080126029Abstract: A method of determining accuracy of predicted system behavior can include creating a plurality of noise adjusted analytical models, wherein each noise adjusted analytical model is associated with a set of predefined analytical model parameters. A set of inferred analytical model parameters for each noise adjusted analytical model can be derived. Each set of inferred analytical model parameters can depend upon a current noise adjusted analytical model and each prior noise adjusted analytical model. For each set of inferred analytical model parameters, a measure of error between the set of inferred analytical model parameters and the set of predefined analytical model parameters associated with the noise adjusted analytical model from which the set of inferred analytical model parameters was derived can be determined.Type: ApplicationFiled: November 24, 2006Publication date: May 29, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Curtis E. Hrischuk, Ed Huth, Dazhi Wang, Li Zhang
-
Publication number: 20080069330Abstract: A method for permitting re-establishment of a parked phone call on a same or different device or medium may include registering information associated with a caller to permit re-establishment of the parked phone call on the same or different communications device or medium in response to the caller electing to park the phone call. The method may also include permitting re-establishment of the parked phone call on the same or different device or medium in response to a called party becoming available.Type: ApplicationFiled: September 20, 2006Publication date: March 20, 2008Inventors: Erik John Burckart, Curtis E. Hrischuk, Matthew John Sheard
-
Publication number: 20080059747Abstract: A computer implemented method, a computer program product and a data processing system for reducing communication signaling protocol latency is provided. Automatic memory management activities, also known as garbage collection activities, are optimized based on a specified level of latency.Type: ApplicationFiled: August 29, 2006Publication date: March 6, 2008Inventors: Erik John Burckart, Curtis E. Hrischuk, Brian Keith Martin
-
Publication number: 20070283349Abstract: A method of distributing functions among a plurality of cores in a multi-core processing environment can include organizing cores of the multi-core processing environment into a plurality of different service pools. Each of the plurality of service pools can be associated with at least one function and have at least one core executing at least one soft co-processor that performs the associated function. The method further can include, responsive to a request from a primary processor to offload a selected function, selecting an available soft co-processor from a service pool associated with the selected function and assigning the selected function to the selected soft co-processor. The method also can include marking the selected soft co-processor as busy and, responsive to receiving an indication from the soft co-processor that processing of the selected function has completed, marking the selected soft co-processor as available.Type: ApplicationFiled: June 5, 2006Publication date: December 6, 2007Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Thomas E. Creamer, Curtis E. Hrischuk
-
Publication number: 20070266380Abstract: Embodiments of the present invention address deficiencies of the art in respect to XML schema validation and provide a method, system and computer program product for optimized XML schema validation and XML document parsing. In one embodiment, an XML data processing system can include shared memory; an XML co-processing proxy comprising program code enabled to receive at least one of XML document schema validation and XML document parsing requests from client applications, and at least one XML processing element coupled to the shared memory. In particular, the XML processing element can be configured to perform the at least one of the XML schema validation and XML document parsing on XML documents provided by the XML co-processing proxy. The XML processing element further can be configured to place results of XML schema validation or the XML document parsing in the shared memory.Type: ApplicationFiled: May 9, 2006Publication date: November 15, 2007Applicant: International Business Machines CorporationInventors: Thomas E. Creamer, Curtis E. Hrischuk