Abstract: A method, computer program product, and system for memory optimization by partitioning extraneous information from executable virtual machine code or interpreted code. The extraneous information may be stored separately, or accessed from the original code if needed for debugging or servicing the code in the field. This approach optimizes memory usage by reducing memory footprint while maintaining accessibility of the non-executable information for debugging and other processes necessary for servicing code in the field.

Abstract: A method of optimizing an application to reduce local memory usage. The method can include instrumenting at least one executable class file of the application with analysis code, the executable class file including bytecode. The method also can include executing the class file on a virtual machine, wherein during execution the analysis code generates data related to the application's use of local memory. The method further can include, via a processor, analyzing the data related to the application's use of the local memory to generate a memory profile analysis. The method further can include, based on the memory profile analysis, automatically revising at least one portion of the bytecode to reduce an amount of the local memory used by the application.

Abstract: An improved solution for managing messages through a request response protocol network utilizing a path-based adaptive prioritization and latency management is provided. A weight for a message is determined at a message management computing device based upon a number of hops and a latency of networks passed through by the message. A hop latency target for a current hop segment is evaluated relative to an overall latency target and the determined weight for the message. A priority of the message is adjusted in response to determining that the overall latency target, relative to the weight for the message and the hop latency target for the current hop segment, exceeds a configured allowable hop latency deviation for the current hop segment.

Abstract: Real-time application metrics of an application executed by a virtual machine are dynamically monitored by a controlling agent and analyzed to determine an optimal configuration of the virtual machine for executing the application. Based on the measured metrics, tunable parameters of the virtual machine may be adjusted to achieve desired application performance.

Abstract: An improved solution for managing messages through a request response protocol network utilizing a path-based adaptive prioritization and latency management is provided. A weight for a message is determined at a message management computing device based upon a number of hops and a latency of networks passed through by the message. A hop latency target for a current hop segment is evaluated relative to an overall latency target and the determined weight for the message. A priority of the message is adjusted in response to determining that the overall latency target, relative to the weight for the message and the hop latency target for the current hop segment, exceeds a configured allowable hop latency deviation for the current hop segment.

Abstract: 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.

Abstract: 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.

Abstract: A method, system and computer program product for optimizing memory usage associated with duplicate string objects in a Java virtual machine. The method comprises scanning a heap of the Java virtual machine at the end of the start-up process of the virtual machine to identify duplicate strings associated with the virtual machine, storing the identified strings in a string cache file, and determining whether a new string that needs to be created during start-up already exists in the string cache file. The duplicate strings are added to an interned strings table. A reference to a duplicate string is returned if a string to be created is already in the string cache file.

Abstract: 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.

Abstract: A three tiered data synchronization system including a client, an enterprise data server, a synchronization server, and a pre-fetch data store. The client can have an associated client data store and the enterprise data server can have an associated server data store. The synchronization sever can intermittently and bidirectionally synchronize data within the client data store with data within the server data store. The pre-fetch data store can maintains data specific to synchronization requests that is used by the synchronization server when performing synchronization operations responsive to detected synchronization requests. The data specific to synchronization request used by the synchronization server is stored within the pre-fetch data store before the corresponding synchronization requests are detected by the synchronization server.

Abstract: A method of reducing the time needed for sending data over a communication network. The method can include analyzing bandwidth usage of a user over a communication network and receiving data associated with the user to be sent over the communication network. The method further can include determining, from the bandwidth usage of the user, a probability that additional data will be received within a specified time period and selectively sending the data via the communication network according to the probability.

Abstract: A method, computer program product, and system for memory optimization by partitioning extraneous information from executable virtual machine code or interpreted code. The extraneous information may be stored separately, or accessed from the original code if needed for debugging or servicing the code in the field. This approach optimizes memory usage by reducing memory footprint while maintaining accessibility of the non-executable information for debugging and other processes necessary for servicing code in the field.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A computer implemented method for reducing communication signaling protocol latency. An acceptable level of latency is specified. Automatic memory management activities are monitored based on specified parameters to calculate a level of activity that determines whether a reduction of activity is required.

Abstract: 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.

Abstract: 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.

Abstract: A bypasser configured to operate within a three tiered synchronization system. The bypasser can include an interceptor and an inference engine. The interceptor can intercept synchronization requests before a synchronization event involving a synchronization server is initiated. The inference engine can determine if the data store and the another data store are to be synchronized and can selectively initiate the synchronization event based on the determination of the inference engine. For example, when the inference engine determines that synchronization is not to occur, the bypasser can convey a notification that no update is needed to the source of an intercepted synchronization request without requiring the synchronization server to process the synchronization request. When the inference engine determines that synchronization is to occur, the bypasser can convey an intercepted synchronization request to the intermediate synchronization server for processing.

Abstract: A method of optimizing the runtime performance of a program written in an interpreted programming language can include loading, within a virtual machine having a Just In Time (JIT) compiler, the program and a file specifying frequency of execution data for at least one component of the program. The program can be executed. The executing step can include reading the file specifying the frequency of execution data, seeding a counter of the virtual machine associated with the component(s) with a value derived from the frequency of execution data, and performing a JIT action upon the component(s) of the program according to the seeded counter of the virtual machine.