Abstract: A configuration of cached information stored within a cache is determined. One or more character omission rules are determined by: identifying the one or more optimizable characters based on the configuration, where the one or more optimizable characters are characters in the stored cached information that do not have an effect on an interpretation of the stored cached information by a requester computer; and determining, based on the configuration, one or more conditions under which omission of the one or more optimizable characters from the stored cached information produces a valid result in view of the configuration. One or more character omission rules are applied to the stored cached information by removing from the stored cached information the one or more optimizable characters that meet the one or more conditions.

Abstract: A configuration of cached information stored within a cache is determined. One or more character omission rules are determined by: identifying the one or more optimizable characters based on the configuration, where the one or more optimizable characters are characters in the stored cached information that do not have an effect on an interpretation of the stored cached information by a requester computer; and determining, based on the configuration, one or more conditions under which omission of the one or more optimizable characters from the stored cached information produces a valid result in view of the configuration. One or more character omission rules are applied to the stored cached information by removing from the stored cached information the one or more optimizable characters that meet the one or more conditions.

Abstract: An algorithm facilitates optimization functionality for generating optimized response information. In facilitating such optimization, non-essential elements of the response information (i.e., unneeded for system interpretation) are eliminated thereby reducing the size of the response information and generating optimized response information as well as reducing the memory footprint of cache required for storing such optimized response information. Examples of such non-essential elements of response information include, but are not limited to, indention characters, tab characters, blank space characters and the like. Such optimization functionality is tailored to optimizing the size of response information being transmitted from a server. More specifically, it provides for reduction in bandwidth occupied by outgoing response information from a transmitting a server.

Abstract: A system and method for analyzing Java thread deadlocks. A snapshot of threads in a Java Virtual Machine is generated, producing a thread dump file which can be analyzed off line. The thread dump file is optimistically parsed to identify threads which are deadlocked. A user is provided with an interface to select filtering rules for the threads, resulting in a set of filtered threads which are candidates for being in infinite wait conditions.

Abstract: A system and method for analyzing Java thread deadlocks. A snapshot of threads in a Java Virtual Machine is generated, producing a thread dump file which can be analyzed offline. The thread dump file is optimistically parsed to identify threads which are deadlocked. A user is provided with an interface to select filtering rules for the threads, resulting in a set of filtered threads which are candidates for being in infinite wait conditions.

Abstract: A system and method for analyzing Java thread deadlocks. A snapshot of threads in a Java Virtual Machine is generated, producing a thread dump file which can be analyzed offline. The thread dump file is optimistically parsed to identify threads which are deadlocked. A user is provided with an interface to select filtering rules for the threads, resulting in a set of filtered threads which are candidates for being in infinite wait conditions.

Abstract: A method, apparatus, and computer instructions for collecting data for analyzing memory leaks. A plurality of indicators are associated with a plurality of objects. The plurality of indicators are set to a first state. An indicator is set for each live object in the plurality of objects to a second state. In response to a request for the data, data is collected from all objects in the plurality of objects having indicators set to the first state.

Abstract: An algorithm facilitates optimization functionality for generating optimized response information. In facilitating such optimization, non-essential elements of the response information (i.e., unneeded for system interpretation) are eliminated thereby reducing the size of the response information and generating optimized response information as well as reducing the memory footprint of cache required for storing such optimized response information. Examples of such non-essential elements of response information include, but are not limited to, indention characters, tab characters, blank space characters and the like. Such optimization functionality is tailored to optimizing the size of response information being transmitted from a server. More specifically, it provides for reduction in bandwidth occupied by outgoing response information from a transmitting a server.

Abstract: A method, apparatus, and computer instructions for collecting data for analyzing memory leaks. A plurality of indicators are associated with a plurality of objects. The plurality of indicators are set to a first state. An indicator is set for each live object in the plurality of objects to a second state. In response to a request for the data, data is collected from all objects in the plurality of objects having indicators set to the first state.

Abstract: A method, system and apparatus for detecting and remediating a memory leak. In the method of the invention, an aging value can be established for an object instance created in memory and resetting the aging value when the object instance is referenced by an executing process. By comparison, the aging value can be incremented during a garbage collection pass when the object instance had not been referenced by an executing process since a previous garbage collection pass. Importantly, when the aging value exceeds a threshold value, the object instance can be processed as a loiterer. The processing step itself can include clearing at least one cache in memory, and reporting said object instance as a loiterer in a log file. Yet, the processing step can be avoided where the object instance belongs to a specified exempt class.

Abstract: A system and method for analyzing Java thread deadlocks. A snapshot of threads in a Java Virtual Machine is generated, producing a thread dump file which can be analyzed offline. The thread dump file is optimistically parsed to identify threads which are deadlocked. A user is provided with an interface to select filtering rules for the threads, resulting in a set of filtered threads which are candidates for being in infinite wait conditions.