Patent application number | Description | Published |
20120137290 | MANAGING MEMORY OVERLOAD OF JAVA VIRTUAL MACHINES IN WEB APPLICATION SERVER SYSTEMS - The invention relates to memory overload management for Java virtual machines (JVMs) in Web application sever systems. Disclosed is a method and system of memory overload management for a Web application sever system, wherein the Web application sever system comprises multiple JVMs, the method comprising: determining one or more replica shards for which replacement shall be performed; determining one or more target JVMs for storing a corresponding replica shard set including at least one replica shard from the one or more replica shards; and for each target JVM, performing the following: judging whether the free memory of the target JVM is adequate for storing the corresponding replica shard set; if the judging result is negative, performing the following: causing the target JVM to suspend the creation of session until the free memory of the target JVM becomes adequate for storing the corresponding replica shard set. | 05-31-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 |
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 |
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 |
20140007052 | DYNAMICALLY CONFIGURING AN INTEGRATED DEVELOPMENT ENVIRONMENT | 01-02-2014 |
20140007053 | DYNAMICALLY CONFIGURING AN INTEGRATED DEVELOPMENT ENVIRONMENT | 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 |