Abstract: A processing system, computer program product, and methods for maintaining consistent values of objects in two or more stores. A method includes a data store associating an update time for each object of a plurality of objects, where each object of the plurality of objects resides on a respective another data store. The data store maintains a data structure ordering the plurality of objects by update times. The data store periodically examines the data structure to read update times. The data store makes a decision to request an updated version of an object belonging to the plurality of objects based on an update time of the object. The data structure can be a balanced tree.

Abstract: A processing system server, computer program product, and methods with the server to provide data values. The server maintains a cache of objects. The server executes an asynchronous computation to determine the value of an object. In response to a request for the object before the asynchronous computation has determined the value of the object, returning a value of the object from the cache. In response to a request for the object after the asynchronous computation has determined the value of the object, returning a value of the object determined by the asynchronous computation.

Abstract: A processing system server and methods with the server to provide data values. The server maintains a cache of objects. The server executes an asynchronous computation to determine the value of an object. In response to a request for the object before the asynchronous computation has determined the value of the object, returning a value of the object from the cache. In response to a request for the object after the asynchronous computation has determined the value of the object, returning a value of the object determined by the asynchronous computation.

Abstract: An information processing system, a computer readable storage medium, and a method for distributing an application among computing nodes in a distributed processing system. The method estimates a cost of storing information pertaining to the application on different computing nodes; estimates a cost for computing resources required to execute the application on different computing nodes; estimates a cost of inter-node communication required to execute the application on different computing nodes; and selects at least one computing node to execute the application based on minimizing a total of at least one of the cost estimates.

Abstract: A method, system, and computer readable storage medium for managing computer memory by an intelligent memory manager. The intelligent memory manager performs a method including: deploying a plurality of memory allocators each customizable to efficiently handle a set of different memory request size distributions in support of at least one application; determining a monetary fee to charge a user based on consumption of memory resources; and determining a frequency of backing up a main memory object in a persistent storage based on a bandwidth consumed by storing the main memory object in the persistent storage.

Abstract: A plurality of memory allocators are initialized within a computing system. At least a first memory allocator and a second memory allocator in the plurality of memory allocators are each customizable to efficiently handle a set of different memory request size distributions. The first memory allocator is configured to handle a first memory request size distribution. The second memory allocator is configured to handle a second memory request size distribution. The second memory request size distribution is different than the first memory request size distribution. At least the first memory allocator and the second memory allocator that have been configured are deployed within the computing system in support of at least one application. Deploying at least the first memory allocator and the second memory allocator within the computing system improves at least one of performance and memory utilization of the at least one application.

Abstract: Methods, systems and computer program products for enhanced storage clients. An interface for using a storage service is provided. The interface for each storage service of a plurality of storage services can be implemented within a storage client. A cache can be integrated within the storage client for reducing a number of accesses to a storage service of the plurality of storage services. A compression method in the storage client can reduce a size of data objects. An encryption method in the storage client can preserve data privacy. An application can select at least one storage service of the plurality of storage services and use the at least one storage service via the storage client.

Abstract: An information processing system, computer readable storage medium, and a method for managing computer memory. The method includes initializing at least one memory allocator within a computing system; deploying the at least one memory allocator on a multi-user or cloud system where users are charged a monetary fee based on consumption of at least one memory resource; determining, by the at least one memory allocator, a consumption of the at least one memory resource; determining a cost associated with the consumption that has been determined; and determining a monetary fee to charge the user based on the cost that has been determined.

Abstract: An information processing system, a computer readable storage medium, and a method for distributing an application among computing nodes in a distributed processing system. The method estimates a cost of storing information pertaining to the application on different computing nodes; estimates a cost for computing resources required to execute the application on different computing nodes; estimates a cost of inter-node communication required to execute the application on different computing nodes; and selects at least one computing node to execute the application based on minimizing a total of at least one of the cost estimates.

Abstract: A plurality of memory allocators are initialized within a computing system. At least a first memory allocator and a second memory allocator in the plurality of memory allocators are each customizable to efficiently handle a set of different memory request size distributions. The first memory allocator is configured to handle a first memory request size distribution. The second memory allocator is configured to handle a second memory request size distribution. The second memory request size distribution is different than the first memory request size distribution. At least the first memory allocator and the second memory allocator that have been configured are deployed within the computing system in support of at least one application. Deploying at least the first memory allocator and the second memory allocator within the computing system improves at least one of performance and memory utilization of the at least one application.

Abstract: A method, information processing system, and computer readable storage medium, vary a maximum heap memory size for one application of a plurality of applications based on monitoring garbage collection activity levels for the plurality of applications, each application including a heap memory, and unused memory in the heap memory being reclaimed by a garbage collector.

Abstract: A method, information processing system, and computer readable storage medium, vary a maximum heap memory size for one application of a plurality of applications based on monitoring garbage collection activity levels for the plurality of applications, each application including a heap memory, and unused memory in the heap memory being reclaimed by a garbage collector.

Abstract: A method, information processing system, and computer readable storage medium, vary a maximum heap memory size for one application of a plurality of applications based on monitoring garbage collection activity levels for the plurality of applications, each application including a heap memory, and unused memory in the heap memory being reclaimed by a garbage collector.

Abstract: A method, information processing system, and computer readable storage medium, vary a maximum heap memory size for one application of a plurality of applications based on monitoring garbage collection activity levels for the plurality of applications, each application including a heap memory, and unused memory in the heap memory being reclaimed by a garbage collector.

Abstract: An information processing system, computer readable storage medium, and method for supporting resilient execution of computer programs. A method provides a resilient store wherein information in the resilient store can be accessed in the event of a failure. The method periodically checkpoints application state in the resilient store. A resilient executor comprises software which executes applications by catching failures. The method uses the resilient executor to execute at least one application. In response to the resilient executor detecting a failure, restoring application state information to the at least one application from a checkpoint stored in the resilient store, the resilient executor resuming execution of the at least one application with the restored application state information.

Abstract: An information processing system, computer readable storage medium, and method for supporting resilient execution of computer programs. A method provides a resilient store wherein information in the resilient store can be accessed in the event of a failure. The method periodically checkpoints application state in the resilient store. A resilient executor comprises software which executes applications by catching failures. The method uses the resilient executor to execute at least one application. In response to the resilient executor detecting a failure, restoring application state information to the at least one application from a checkpoint stored in the resilient store, the resilient executor resuming execution of the at least one application with the restored application state information.

Abstract: An information processing system, a computer readable storage medium, and a method for distributing an application among computing nodes in a distributed processing system. The method estimates a cost of storing information pertaining to the application on different computing nodes; estimates a cost for computing resources required to execute the application on different computing nodes; estimates a cost of inter-node communication required to execute the application on different computing nodes; and selects at least one computing node to execute the application based on minimizing a total of at least one of the cost estimates.

Abstract: An information processing system, computer readable storage medium, and method for supporting resilient execution of computer programs. A method provides a resilient store wherein information in the resilient store can be accessed in the event of a failure. The method periodically checkpoints application state in the resilient store. A resilient executor comprises software which executes applications by catching failures. The method uses the resilient executor to execute at least one application. In response to the resilient executor detecting a failure, restoring application state information to the at least one application from a checkpoint stored in the resilient store, the resilient executor resuming execution of the at least one application with the restored application state information.

Abstract: An information processing system, computer readable storage medium, and method for supporting resilient execution of computer programs. A method provides a resilient store wherein information in the resilient store can be accessed in the event of a failure. The method periodically checkpoints application state in the resilient store. A resilient executor comprises software which executes applications by catching failures. The method uses the resilient executor to execute at least one application. In response to the resilient executor detecting a failure, restoring application state information to the at least one application from a checkpoint stored in the resilient store, the resilient executor resuming execution of the at least one application with the restored application state information.

Abstract: Various embodiments monitor system noise in a parallel computing system. In one embodiment, at least one set of system noise data is stored in a shared buffer during a first computation interval. The set of system noise data is detected during the first computation interval and is associated with at least one parallel thread in a plurality of parallel threads. Each thread in the plurality of parallel threads is a thread of a program. The set of system noise data is filtered during a second computation interval based on at least one filtering condition creating a filtered set of system noise data. The filtered set of system noise data is then stored.