| Patent application number | Description | Published |
|---|
| 20080239960 | PATH-BASED ADAPTIVE PRIORITIZATION AND LATENCY MANAGEMENT - 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. | 10-02-2008 |
| 20080307183 | AUTOMATIC MEMORY MANAGEMENT (AMM) - 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. | 12-11-2008 |
| 20090055615 | MEMORY TUNING FOR GARBAGE COLLECTION AND CENTRAL PROCESSING UNIT (CPU) UTILIZATION OPTIMIZATION - 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. | 02-26-2009 |
| 20090063594 | COMPUTER SYSTEM MEMORY MANAGEMENT - 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. If it is found to be suitable, it is removed to reclaim the object memory space it previously occupied, If it is actually examined but is found not to be suitable for removal, the MM immunity value is reset to its original value or is otherwise adjusted to prevent examination of the object for a certain number of future iterations of the memory management process. | 03-05-2009 |
| 20090112952 | LOW LATENCY OPTIMIZATION FOR GENERATIONAL GARBAGE COLLECTION - 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. | 04-30-2009 |
| 20090122704 | Limiting Extreme Loads At Session Servers - 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. | 05-14-2009 |
| 20090122705 | Managing Bursts of Traffic In Such a Manner as to Improve The Effective Utilization of Session Servers - 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. | 05-14-2009 |
| 20090138237 | Run-Time Characterization of On-Demand Analytical Model Accuracy - 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. | 05-28-2009 |
| 20100088412 | CAPACITY SIZING A SIP APPLICATION SERVER BASED ON MEMORY AND CPU CONSIDERATIONS - A SIP workload can be defined. A number of nodes of a SIP application server needed to handle the SIP workload can be determined based upon memory considerations. A number of nodes of the SIP application server needed to handle the SIP workload can be determined base upon CPU considerations. The SIP application server can be capacity sized based upon a greater of the determined number of nodes based upon memory consideration and the determined number of nodes based upon CPU considerations. | 04-08-2010 |
