Abstract: Embodiments of the present invention provide a method, system and computer program product for the seamless integration of an application with an in memory data grid. In an embodiment of the invention, a method for intercepting database queries from a computer program for delegation to an in memory data grid is provided. The method includes retrieving database queries from a database driver for a database management system from a requesting computer program and comparing at least a portion of each of the database queries to a listing of database queries. Thereafter, the database queries are selectively routed to a data grid, such as an in memory data grid, in lieu of the database management based upon the comparison.

Abstract: Systems and methods of managing an in-memory data grid (IMDG) may involve conducting a data distribution analysis of the IMDG on a periodic basis, and selecting a hash scheme from a plurality of hash schemes based on the data distribution analysis. In one example, the selected hash scheme is used to conduct a repopulation of the IMDG, wherein the repopulation increases the distribution evenness of database records across the IMDG.

Abstract: Systems and methods of managing an in-memory data grid (IMDG) may involve conducting a data distribution analysis of the IMDG on a periodic basis, and selecting a hash scheme from a plurality of hash schemes based on the data distribution analysis. In one example, the selected hash scheme is used to conduct a repopulation of the IMDG, wherein the repopulation increases the distribution evenness of database records across the IMDG.

Abstract: Systems (100) and methods (200) for managing transactional processing. The methods involve executing a first transaction (120) which is blocked by an exclusive lock of at least one second transaction (110) from accessing at least one resource of a system. Thereafter, a determination is made as to whether a Service Level Agreement (“SLA”) associated with the first transaction is being met. If it is determined that the SLA is not being met, the resources needed by the first transaction are identified. Subsequently, all executing transactions, that are using the resources needed by the first transaction, are identified. At least one of the identified transactions is then dynamically slowed down or speed up. The transaction is slowed down or sped up by: adjusting how many records are to be processed in each sub-transaction of the transaction; and/or increasing or decreasing the time period between commit operations of the transaction.

Abstract: Systems (100) and methods (200) for managing transactional processing. The methods involve executing a first transaction (120) which is blocked by an exclusive lock of at least one second transaction (110) from accessing at least one resource of a system. Thereafter, a determination is made as to whether a Service Level Agreement (“SLA”) associated with the first transaction is being met. If it is determined that the SLA is not being met, the resources needed by the first transaction are identified. Subsequently, all executing transactions, that are using the resources needed by the first transaction, are identified. At least one of the identified transactions is then dynamically slowed down or speed up. The transaction is slowed down or sped up by: adjusting how many records are to be processed in each sub-transaction of the transaction; and/or increasing or decreasing the time period between commit operations of the transaction.

Abstract: Embodiments of the present invention provide a method, system and computer program product for the dynamic structural management of an n-Tier distributed caching infrastructure. In an embodiment of the invention, a method of dynamic structural management of an n-Tier distributed caching infrastructure includes establishing a communicative connection to a plurality of cache servers arranged in respective tier nodes in an n-Tier cache, collecting performance metrics for each of the cache servers in the respective tier nodes of the n-Tier cache, identifying a characteristic of a specific cache resource in a corresponding one of the tier nodes of the n-Tier crossing a threshold, and dynamically structuring a set of cache resources including the specific cache resource to account for the identified characteristic.

Abstract: A method for consolidating objects to a grid of a virtual machine may include allocating, by a virtual machine operating on a processing device, each new object into an allocate space of a new memory area for newly created objects in a virtual machine memory of the virtual machine. The new memory area may include the allocate space and a survivor space. The method may also include performing a garbage collection process in response to the allocate space becoming substantially full of objects and copying at least some objects in the allocate space into either the survivor space or a tenured space in the virtual machine memory in response to the garbage collection process. The method may also include transferring a selected object from the tenured space to the grid of the virtual machine in response to a predetermined criterion.

Abstract: A method, information processing system, and computer program storage product for associating jobs with resource subsets in a job scheduler. At least one job class that defines characteristics associated with a type of job is received. A list of resource identifiers for a set of resources associated with the job class is received. A set of resources available on at least one information processing system is received. The resource identifiers are compared with each resource in the set of resources available on the information processing system. A job associated with the job class with is scheduled with a set of resources determined to be usable by the job based on the comparing.

Abstract: A batch data stream, which comprises inputs to a serial batch application program, is received. Batch code from the serial batch application program is translated into parallel code that is executable in parallel by multiple execution units. Checkpoints are applied to the batch data stream that has been received, and data between the checkpoints defines multiple threads. The multiple threads are stored in an input queue that feeds data inputs to multiple execution units. The parallel code is then executed in the multiple execution units by using the multiple threads as inputs.

Abstract: A computer program product for database query optimization including a computer usable medium having a computer readable program, wherein the computer readable program, when executed on a computer, causes the computer to receive a database query, search the database query for a literal term, replace the literal term in the database query with a placeholder term to put the database query in a template form, search a directory for a replacement query that corresponds to the database query in the template form, replace the database query with the replacement query and include the placeholder term in the replacement query, and replace the placeholder term in the replacement query with the corresponding literal term to put the replacement query in an executable format, wherein the replacement query is an optimized substitute for the database query.

Abstract: Embodiments of the present invention provide a method, system and computer program product for the dynamic structural management of an n-Tier distributed caching infrastructure. In an embodiment of the invention, a method of dynamic structural management of an n-Tier distributed caching infrastructure includes establishing a communicative connection to a plurality of cache servers arranged in respective tier nodes in an n-Tier cache, collecting performance metrics for each of the cache servers in the respective tier nodes of the n-Tier cache, identifying a characteristic of a specific cache resource in a corresponding one of the tier nodes of the n-Tier crossing a threshold, and dynamically structuring a set of cache resources including the specific cache resource to account for the identified characteristic.

Abstract: Embodiments of the present invention provide a method, system and computer program product for enforcing performance goals in an n-Tier distributed caching infrastructure. In an embodiment of the invention, a method of enforcing performance goals in an n-Tier distributed caching infrastructure can include establishing a communicative connection to multiple different cache servers arranged in respective tier nodes in an n-Tier cache. The method also can include collecting performance metrics for each of the cache servers in the respective tier nodes of the n-Tier cache and identifying a cache server amongst the cache servers in respective tier nodes of the n-Tier demonstrating a performance likely to breach at least one term of an SLA. Finally, the method can include applying a remedial measure to the identified cache server.

Abstract: A central configuration server is provided for managing user-specified configuration data for a configurable device. The central configuration server, which is separate from a configurable device to be configured, and which services a plurality of users, obtains a user identification and device information from the configurable device. Responsive to this, the central configuration server accesses an account database and uses the user identification and device information to retrieve, for the identified user, user-specified configuration data for the configurable device. The central configuration server then forwards the user-specified configuration data from the account database to the configurable device for use in automatically configuring the configurable device pursuant to the user-specified configuration data.

Abstract: A computer program product for database query optimization including a computer usable medium having a computer readable program, wherein the computer readable program, when executed on a computer, causes the computer to receive a database query, search the database query for a literal term, replace the literal term in the database query with a placeholder term to put the database query in a template form, search a directory for a replacement query that corresponds to the database query in the template form, replace the database query with the replacement query and include the placeholder term in the replacement query, and replace the placeholder term in the replacement query with the corresponding literal term to put the replacement query in an executable format, wherein the replacement query is an optimized substitute for the database query.

Abstract: A method, information processing system, and computer program storage product for associating jobs with resource subsets in a job scheduler. At least one job class that defines characteristics associated with a type of job is received. A list of resource identifiers for a set of resources associated with the job class is received. A set of resources available on at least one information processing system is received. The resource identifiers are compared with each resource in the set of resources available on the information processing system. A job associated with the job class with is scheduled with a set of resources determined to be usable by the job based on the comparing.

Abstract: Roll back strategies for database deadlock resolution are customized by identifying a first transaction to a database, identifying a second transaction to the database and detecting a deadlock between the first and second transactions with respect to the database. The deadlock is resolved based upon a predetermined roll back strategy associated with at least one of the first or second transactions to identify a select one of the first and second transactions for roll back and a request is conveyed to roll back the selected one of the first and second transactions, wherein the preferred transaction is allowed to continue processing.

Abstract: Systems, methods and computer program products are provided for reducing overhead in component interactions comprising monitoring interactions between components residing within a domain boundary; storing data indicative of the interactions; analyzing the data to determine whether there is a first component on a first server and a second component on a second server within the domain boundary that are coupled and dislocated that should be co-located; evaluating available server resources; determining whether the first and second components can be co-located based upon the evaluation of available server resources; and conveying a request to co-locate the first and second components if it is determined that the first and second components can be co-located.

Abstract: Systems, methods and computer program products are provided for identifying a first component on a first server and a second component on a second server for co-location, where the first and second servers are within a domain boundary; inspecting available server resources within the domain boundary; determining a select server in the domain boundary for co-location based upon the inspection of available server resources; and autonomically co-locating the first and second components to the select server.