Patent application number | Description | Published |
20080301504 | Method and Apparatus to Anticipate Memory Exhaustion in an Open Services Gateway Initiative Environment - A computer implemented method, computer program product, and data processing system for predicting a future status of a memory leak. A first set of data including memory consumption data is received at a software bundle. The software bundle is operating in an open services gateway initiative environment. Responsive to a determination that a memory leak exists, the first set of data is analyzed to predict a future status of the memory leak. The future status is stored, as stored data, in a storage device. | 12-04-2008 |
20120180045 | DETERMINING AN OPTIMAL COMPUTING ENVIRONMENT FOR RUNNING AN IMAGE - Aspects of the present invention provide an approach that evaluates a locally running image (e.g., such as that for a virtual machine (VM)) and determines if that image could run more efficiently and/or more effectively in an alternate computing environment (e.g., a cloud computing environment). Specifically, embodiments of the present invention evaluate the local (existing/target) image's actual and perceived performance, as well as the anticipated/potential performance if the image were to be migrated to an alternate environment. The anticipated/potential performance can be measured based on another image that is similar to the existing/target image but where that image is running in a different computing environment. Regardless, the system would display a recommendation to the end user if it were determined that the image could perform better in the alternate environment (or vice versa). It is understood that performance is just one illustrative metric for which the system would perform a comparison. Other metrics such as cost, reliability, availability, etc. could also be used. | 07-12-2012 |
20120185500 | DATA STORAGE AND MANAGEMENT SYSTEM | 07-19-2012 |
20120278344 | PROXIMITY GRIDS FOR AN IN-MEMORY DATA GRID - Techniques are described for scaling an in-memory data grid to satisfy the needs of client applications requesting data from the in-memory data grid. The in-memory data grid may monitor a variety of factors, such as data traffic or number of received queries from a particular geographical region, to determine whether to create a proximity grid. A proximity grid is an extension of the in-memory data grid that services queries originating from a defined geographic region. Each proximity grid stores data objects relevant to the proximity grid's assigned geographic region. Queries originating from the client applications within the geographic regions are then routed to the corresponding proximity grid for execution. The proximity grid may be terminated when the need of the client applications within the geographic region has subsided. | 11-01-2012 |
20120303634 | In-Memory Data Grid Hash Scheme Optimization - 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. | 11-29-2012 |
20120303675 | In-Memory Data Grid Hash Scheme Optimization - 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. | 11-29-2012 |
20120311295 | SYSTEM AND METHOD OF OPTIMIZATION OF IN-MEMORY DATA GRID PLACEMENT - A method, system, and program product for optimizing distribution and availability of data partitions is disclosed. Placement logic is run for data partition distribution which optimizes a configuration of a memory data grid. A performance impact of adding new members to the memory data grid is provided. Replication of data partitions in the memory data grid is minimized. Optimum data partition distribution in the memory data grid is determined. | 12-06-2012 |
20130036267 | PLACEMENT OF DATA IN SHARDS ON A STORAGE DEVICE - A method, system and computer program product for placing data in shards on a storage device may include determining placement of a data set in one of a plurality of shards on the storage device. Each one of the shards may include a different at least one performance feature. Each different at least one performance feature may correspond to a different at least one predetermined characteristic associated with a particular set of data. The data set is cached in the one of the plurality of shards on the storage device that includes the at least one performance feature corresponding to the at least one predetermined characteristic associated with the data set being cached. | 02-07-2013 |
20130036269 | PLACEMENT OF DATA IN SHARDS ON A STORAGE DEVICE - A method, system and computer program product for placing data in shards on a storage device may include determining placement of a data set in one of a plurality of shards on the storage device. Each one of the shards may include a different at least one performance feature. Each different at least one performance feature may correspond to a different at least one predetermined characteristic associated with a particular set of data. The data set is cached in the one of the plurality of shards on the storage device that includes the at least one performance feature corresponding to the at least one predetermined characteristic associated with the data set being cached. | 02-07-2013 |
20130041971 | TECHNIQUE FOR IMPROVING REPLICATION PERSISTANCE IN A CACHING APPLICANCE STRUCTURE - A method for improving replication persistence in a caching appliance structure can begin when a primary catalog service receives a command to instantiate a data partition. The primary catalog service can manage a collective of caching appliances in a networked computing environment. The data partition can include a primary shard and at least one replica shard. The primary shard of the data partition can be stored within a memory space of a first caching appliance. The at least one replica shard of the data partition can be stored within a non-volatile storage space of a second caching appliance. The first and the second caching appliances can be separate physical devices. The memory space of the second caching appliance that could have been used to store the at least one replica shard can be available for storing primary shards for other data partitions, increasing the capacity of the collective. | 02-14-2013 |
20130073809 | DYNAMICALLY ALTERING TIME TO LIVE VALUES IN A DATA CACHE - 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. | 03-21-2013 |
20130198400 | Cognitive Dynamic Allocation in Caching Appliances - An approach is provided in which a caching appliance receives a data packet over a network connection utilizing a network protocol. The caching appliance selects a storage area based upon the network protocol and stores the data packet in the selected storage area. In one embodiment, the caching appliance identifies a service level that corresponds to the network protocol and selects the storage area based upon the identified service level. | 08-01-2013 |
20130212340 | PARTITION AWARE QUALITY OF SERVICE FEATURE - A method for providing a partition aware quality of service feature may include receiving an indication of data to be stored in a distributed memory grid, determining a quality of service policy rule to be applied in relation to storage of the data in the memory grid based on the indication, and initiating storage of data blocks of the data in the memory grid. The data blocks may be provided with corresponding partition identifiers that facilitate retrieval of the data by indicating a location of storage of respective ones of the data blocks within the memory grid. The method may further include providing a quality of service token in association with the partition identifier based on the quality of service policy rule. | 08-15-2013 |
20130227232 | PARTITION AWARE QUALITY OF SERVICE FEATURE - A method for providing a partition aware quality of service feature may include receiving an indication of data to be stored in a distributed memory grid, determining a quality of service policy rule to be applied in relation to storage of the data in the memory grid based on the indication, and initiating storage of data blocks of the data in the memory grid. The data blocks may be provided with corresponding partition identifiers that facilitate retrieval of the data by indicating a location of storage of respective ones of the data blocks within the memory grid. The method may further include providing a quality of service token in association with the partition identifier based on the quality of service policy rule. | 08-29-2013 |
20130246462 | AUTONOMIC CACHING FOR IN MEMORY DATA GRID QUERY PROCESSING - A method, system and computer program product for autonomic caching in an IMDG has been provided. A method for autonomic caching in an IMDG includes receiving from a client of the IMDG a request for a primary query in the IMDG. The method also includes associating the primary query with a previously requested sub-query related to the primary query. Finally, the method includes directing the sub-query concurrently with a directing of the primary query without waiting to receive a request for the sub-query from the client. In this way, the method can proactively predict a receipt of the request for a sub-query following a request for a primary query prior the actual receipt of the request for the sub-query. | 09-19-2013 |
20130339392 | DYNAMIC MAP TEMPLATE DISCOVERY AND MAP CREATION - A method, system and computer program product for dynamic map template discovery and map creation may include determining a frequency of use of a data object in a database and discovering a dynamic map template corresponding to the data object based on the frequency of use of the data object. The method may also include creating a dynamic map from the dynamic map template in response to discovering the dynamic map template. | 12-19-2013 |
20130339393 | DYNAMIC MAP TEMPLATE DISCOVERY AND MAP CREATION - A method, system and computer program product for dynamic map template discovery and map creation may include determining a frequency of use of a data object in a database and discovering a dynamic map template corresponding to the data object based on the frequency of use of the data object. The method may also include creating a dynamic map from the dynamic map template in response to discovering the dynamic map template. | 12-19-2013 |
20140007052 | DYNAMICALLY CONFIGURING AN INTEGRATED DEVELOPMENT ENVIRONMENT | 01-02-2014 |
20140007053 | DYNAMICALLY CONFIGURING AN INTEGRATED DEVELOPMENT ENVIRONMENT | 01-02-2014 |
20140007130 | DETERMINING AN OPTIMAL COMPUTING ENVIRONMENT FOR RUNNING AN IMAGE | 01-02-2014 |
20140074966 | INTELLIGENT MAPPING FOR AN ENTERPRISE GRID - A computer receives a request from a client application for data within an enterprise grid. The computer sends the data along with a program to monitor the application's use of the data. The computer subsequently receives from the program a subset of the data being utilized by the client application. Responsive to a subsequent request for the data, the computer sends to the client application only the data corresponding to the identified subset of data being utilized. | 03-13-2014 |
20140089260 | WORKLOAD TRANSITIONING IN AN IN-MEMORY DATA GRID - Embodiments of the present invention disclose a method, system, and computer program product for transitioning a workload of a grid client from a first grid server to a second grid server. A replication process is commenced transferring application state from the first grid server to the second grid server. Prior to completion of the replication process: the grid client is rerouted to communicate with the second grid server. The second grid server receives a request from the grid client. The second grid server determines whether one or more resources necessary to handle the request have been received from the first grid server. Responsive to determining that the one or more resources have not been received from the first grid server, the second grid server queries the first grid server for the one or more resources. The second grid server responds to the request from the grid client. | 03-27-2014 |
20140244953 | IDENTIFYING AND ACCESSING REFERENCE DATA IN AN IN-MEMORY DATA GRID - Embodiments relate to providing normalization techniques for reference data in an in-memory data grid. An aspect includes monitoring object creation and access in an in-memory data grid and identifying reference data in an object field of a plurality of object instances. A reference map for the object field is created and the reference map is replicated across all partitions of the in-memory data grid. The reference data of an embodiment is stored in the reference map and the object field is updated to identify the reference map. Accordingly, the reference data may be accessed using the created reference map. | 08-28-2014 |
20140244954 | IDENTIFYING AND ACCESSING REFERENCE DATA IN AN IN-MEMORY DATA GRID - Embodiments relate to providing normalization techniques for reference data in an in-memory data grid. An aspect includes monitoring object creation and access in an in-memory data grid and identifying reference data in an object field of a plurality of object instances. A reference map for the object field is created and the reference map is replicated across all partitions of the in-memory data grid. The reference data of an embodiment is stored in the reference map and the object field is updated to identify the reference map. Accordingly, the reference data may be accessed using the created reference map. | 08-28-2014 |
20150019584 | SELF-LEARNING JAVA DATABASE CONNECTIVITY (JDBC) DRIVER - Various embodiments include solutions for querying desired data from a database without pulling supererogatory data. In one embodiment, a method includes: obtaining an initial database access query between an application and the database at a self-learning JDBC driver; monitoring subsequent database access queries between the application and the database over a period; and generating a modified database access query for querying the database from the self-learning JDBC driver, the modified database access query based upon the subsequent database access queries between the application and the database over the period. | 01-15-2015 |
20150080027 | METHOD FOR GROUP SOCIAL SUGGESTIONS BASED ON SPATIAL DATA AND SHARED PREFERENCES - A method and system for managing a group activity using electronic communications includes joining a plurality of users to form a proximity based network. Data is received and accessed from the plurality of users each using a mobile device configured to communicate with the proximity based network on the communications network. The data includes location information and personal information. A multiplicity of social connections are defined between the users based on the data. A set of the plurality of users are identified wherein at least two of the mobile devices are within the predetermined proximity, and the corresponding users have a shared social connection, A proposed activity is defined for the set of the users based on the shared social connection. The set of users of the proposed activity are notified. | 03-19-2015 |