International Business Machines Corporation

Snehal S Antani

Kulvir Singh Bhogal

Nitin Gaur

Erik John Burckart

Rohit Dilip Kelapure

Christopher D Johnson

Hari Shankar

Mohammad N Fakhar

Sridhar Sudarsan

Christopher Paul Vignola

Neeraj Joshi

Chris D Johnson

Rajesh P Ramachandran

Todd Eric Kaplinger

Wei Gao

Heng Wang

Yan Wu

Junjie Cai

Soloman J Barghouthi

Frank J Degilio

Jia Fei

Chon N Lei

Adarsh R Pannu

Sajan Sankaran

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.

Customized roll back strategy for databases in mixed workload environments

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.

Interception of database queries for delegation to an in memory data grid

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.

Dynamic structural management of a distributed caching infrastructure

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.

Defining enforcing and governing performance goals of a distributed caching infrastructure

The present invention discloses a method and system for sharing application objects among multiple tenants, wherein the method comprises: identifying objects that can be shared by multiple tenants; merging the objects that can be shared by the multiple tenants; and updating references of the tenants to the shared objects prior to the merging so as to cause the references to point at a merged shared object. The method of the present invention enables the tenants to share application data more efficiently.

Sharing application objects among multiple tenants

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.

Autonomically co-locating first and second components on a select server

A TTL value for a data object stored in-memory in a data grid is dynamically adjusted. A stale data tolerance policy is set. Low toleration for staleness would mean that eviction is certain, no matter the cost, and high toleration would mean that the TTL value would be set based on total cost. Metrics to report a cost to re-create and re-store the data object are calculated, and the TTL value is adjusted based on calculated metrics. Further factors, such as, cleanup time to evict data from a storage site, may be considered in the total cost.

Dynamically altering time to live values in a data cache

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.

Reducing overhead in component interactions

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.

In-memory data grid hash scheme optimization

Systems () and methods () for managing transactional processing. The methods involve executing a first transaction () which is blocked by an exclusive lock of at least one second transaction () 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.

Growing community of inventors

Hyde Park, NY, United States of America

Snehal S Antani