Abstract: A method, apparatus and program product deallocate an object from a memory heap in a virtual machine environment by, in part, determining that the object is replaceable using an object reference associated with the object. The object may additionally be automatically determined as being properly removable by using a value indicative of a number of object references associated with the object. Where these conditions are met, the object may be removed from the memory heap. Where a new object can fit into a space within the memory from which the object was removed, the new object may be automatically allocated into the space. The object may be designated as being replaceable using automated or manual processes. A garbage collector algorithm may additionally execute, as needed.

Abstract: A method, apparatus and program product facilitate the collaborative development of an algorithm by, in part, displaying an algorithm associated with a performance attribute, and receiving user input relating to the algorithm from a plurality of networked users. The performance attribute of the algorithm may be automatically modified based on the user input. The modified performance attribute may be displayed to the plurality of networked users. A query may be received from a user interested in the algorithm. In response to the user query, the algorithm may be located from among a plurality of algorithms. For instance, the algorithm may be located from among the plurality of algorithms by matching the performance attribute to a criterion of the user query. Alternatively or additionally, the algorithm may be located by matching the performance attribute to a profile of the user submitting the user query.

Abstract: A program product, apparatuses, and methods provide for the collection of profile information for a component of a software program by generating a data structure that maps at least one method to a component. The method includes a name, and the data structure maps the method to the component using at least a portion of the name of the method. A class or pattern may also be mapped to a component. Furthermore, during profiling, a statistic associated with the execution of the method is determined; the data structure is accessed using the name of the method to determine the associated component; and the determined statistic is associated with the determined component. By doing so, method level and class level information can be aggregated to improve profiling, often leading to a clearer picture of which components are contributing to the performance and memory footprint of large scale software programs.

Abstract: A program product, apparatuses, and methods provide for the collection of profile information for a component of a software program by generating a data structure that maps at least one method to a component. The method includes a name, and the data structure maps the method to the component using at least a portion of the name of the method. A class or pattern may also be mapped to a component. Furthermore, during profiling, a statistic associated with the execution of the method is determined; the data structure is accessed using the name of the method to determine the associated component; and the determined statistic is associated with the determined component. By doing so, method level and class level information can be aggregated to improve profiling, often leading to a clearer picture of which components are contributing to the performance and memory footprint of large scale software programs.

Abstract: A method, apparatus and program product deallocate an object from a memory heap in a virtual machine environment by, in part, determining that the object is replaceable using an object reference associated with the object. The object may additionally be automatically determined as being properly removable by using a value indicative of a number of object references associated with the object. Where these conditions are met, the object may be removed from the memory heap. Where a new object can fit into a space within the memory from which the object was removed, the new object may be automatically allocated into the space. The object may be designated as being replaceable using automated or manual processes. A garbage collector algorithm may additionally execute, as needed.

Abstract: A method, apparatus and program product facilitate the collaborative development of an algorithm by, in part, displaying an algorithm associated with a performance attribute, and receiving user input relating to the algorithm from a plurality of networked users. The performance attribute of the algorithm may be automatically modified based on the user input. The modified performance attribute may be displayed to the plurality of networked users. A query may be received from a user interested in the algorithm. In response to the user query, the algorithm may be located from among a plurality of algorithms. For instance, the algorithm may be located from among the plurality of algorithms by matching the performance attribute to a criterion of the user query. Alternatively or additionally, the algorithm may be located by matching the performance attribute to a profile of the user submitting the user query.

Abstract: A method, apparatus, system, and signal-bearing medium that, in an embodiment, calculate the average number of servers that executed an application in a previous time period, decide whether the current number of servers that execute the application is less than the average number of servers, and, if so, power on the average number of servers. The application is then distributed across the average number of servers. In an embodiment, the server is powered on by increasing the clock speed of the processors associated with the servers. In an embodiment, a determination is periodically made whether the response time of the application is greater than a threshold, and, if so, the servers are powered on and the application is distributed across the servers. In an embodiment, a determination is periodically made whether the response time of the application is less than a threshold, and, if so, servers are powered off and the application is distributed across the remaining servers.