Patent application number | Description | Published |
20120198055 | SYSTEM AND METHOD FOR USE WITH A DATA GRID CLUSTER TO SUPPORT DEATH DETECTION - A system and method is described for use with a data grid cluster to support death detection. A network ring is formed by connecting a plurality of process nodes in the data grid, wherein each node in the network ring watches another node. A death of a first process node in the network ring can be detected by a second process node, when the second process node notices that its connection to the first process node has closed. The first process node then informs other process cluster nodes in the network ring that the first node is dead. In accordance with an embodiment, machine level death detection can also be supported in the data grid cluster by using an Internet Protocol (IP) monitor. | 08-02-2012 |
20140075071 | SYSTEM AND METHOD FOR SUPPORTING MESSAGE PRE-PROCESSING IN A DISTRIBUTED DATA GRID CLUSTER - A system and method can support message pre-processing in a distributed data grid. The system can associate a message bus with a service thread on a cluster member in the distributed data grid. Furthermore, the system can receive one or more incoming messages at the message bus using an input/output (I/O) thread, and pre-process said one or more incoming messages on the I/O thread before each said incoming message is delivered to a service thread in the distributed data grid. Additionally, the system can take advantage of a pool of input/output (I/O) threads to deserialize inbound messages before they are delivered to the addressed service, and can relieve the bottleneck that is caused by performing all message deserialization in a single threaded fashion before the message type can be identified and offloaded to the thread-pool within the distributed data grid. | 03-13-2014 |
20140075078 | SYSTEM AND METHOD FOR SUPPORTING A SCALABLE MESSAGE BUS IN A DISTRIBUTED DATA GRID CLUSTER - A system and method can a scalable message bus in a distributed data grid. The system can provide a plurality of message buses in the distributed data grid, wherein the distributed data grid includes a plurality of cluster members and provides a plurality of services. Furthermore, the system can associate each said service in the distributed data grid with a said message bus, and use the plurality of message buses to support data transferring between different services on different cluster members in the distributed data grid. Additionally, the system can use a datagram layer to support clustering in the distributed data grid, and bypass the datagram layer in the distributed data grid for data transferring. | 03-13-2014 |
Patent application number | Description | Published |
20120197822 | SYSTEM AND METHOD FOR USING CLUSTER LEVEL QUORUM TO PREVENT SPLIT BRAIN SCENARIO IN A DATA GRID CLUSTER - A system and method is described for use with a data grid cluster, which uses cluster quorum to prevent split brain scenario. The data grid cluster includes a plurality of cluster nodes, each of which runs a cluster service. Each cluster service collects and maintains statistics regarding communication flow between its cluster node and the other cluster nodes in the data grid cluster. The statistics are used to determine a status associated with other cluster nodes in the data grid cluster whenever a disconnect event happens. The data grid cluster is associated with a quorum policy, which is defined in a cache configuration file, and which specifies a time period that a cluster node will wait before making a decision on whether or not to evict one or more cluster nodes from the data grid cluster. | 08-02-2012 |
20120198055 | SYSTEM AND METHOD FOR USE WITH A DATA GRID CLUSTER TO SUPPORT DEATH DETECTION - A system and method is described for use with a data grid cluster to support death detection. A network ring is formed by connecting a plurality of process nodes in the data grid, wherein each node in the network ring watches another node. A death of a first process node in the network ring can be detected by a second process node, when the second process node notices that its connection to the first process node has closed. The first process node then informs other process cluster nodes in the network ring that the first node is dead. In accordance with an embodiment, machine level death detection can also be supported in the data grid cluster by using an Internet Protocol (IP) monitor. | 08-02-2012 |
20120198455 | SYSTEM AND METHOD FOR SUPPORTING SERVICE LEVEL QUORUM IN A DATA GRID CLUSTER - A system and method is described for use with a data grid cluster, for supporting service level quorum in the data grid cluster. The data grid cluster includes a plurality of cluster nodes that support performing at least one service action. A quorum policy, defined in a cache configuration file associated with the data grid cluster, can specify a minimum number of service members that are required in the data grid cluster for performing the service action. The data grid cluster uses the quorum policy to determine whether the service action is allowed to be performed, based on a present state of the plurality of cluster nodes in the data grid cluster. | 08-02-2012 |
20120265924 | ELASTIC DATA TECHNIQUES FOR MANAGING CACHE STORAGE USING RAM AND FLASH-BASED MEMORY - A set of data caching techniques are described which are used to seamlessly store data across both RAM and flash based memory. The techniques utilize a memory manager that includes a RAM journal and a flash journal to efficiently store the data and to make the management of the data across both mediums transparent to the user. The flash based journal works in conjunction with the RAM journal and takes the overflow of data from the RAM journal when certain capacity limits are reached. The resource manager uses journaling techniques to write data to the cache and manages the garbage collection created by the data journaling. | 10-18-2012 |
20120297056 | EXTENSIBLE CENTRALIZED DYNAMIC RESOURCE DISTRIBUTION IN A CLUSTERED DATA GRID - A centralized resource distribution is described where the decision portion of partitioning data among cluster nodes is made centralized while the actual mechanics to implement the partitioning remain a distributed algorithm. A central distribution coordinator is used to create an extensible central strategy that controls how the data will be partitioned across the cluster. The work to implement this strategy is performed by all of the members individually and asynchronously, in accordance with a distributed algorithm. The central strategy can be communicated to all cluster members and each member can perform the partitioning as it relates to itself. For example, in accordance with the distributed algorithm, one node may decide that it needs to obtain a particular partition in light of the central strategy and carry out the necessary steps to obtain that data, while other nodes may be asynchronously performing other individual partition transfers relevant to those particular nodes. | 11-22-2012 |
20130041969 | SYSTEM AND METHOD FOR PROVIDING A MESSAGING APPLICATION PROGRAM INTERFACE - A system and method for providing a message bus component or version thereof (referred to herein as an implementation), and a messaging application program interface, for use in an enterprise data center, middleware machine system, or similar environment that includes a plurality of processor nodes together with a high-performance communication fabric (or communication mechanism) such as InfiniBand. In accordance with an embodiment, the messaging application program interface enables features such as asynchronous messaging, low latency, and high data throughput, and supports the use of in-memory data grid, application server, and other middleware components. | 02-14-2013 |
20130074083 | SYSTEM AND METHOD FOR HANDLING STORAGE EVENTS IN A DISTRIBUTED DATA GRID - A system and method can handle storage events in a distributed data grid. The distributed data grid cluster includes a plurality of cluster nodes storing data partitions distributed throughout the cluster, each cluster node being responsible for a set of partitions. A service thread, executing on at least one of said cluster nodes in the distributed data grid, is responsible for handling one or more storage events. The service thread can use a worker thread to accomplish synchronous event handling without blocking the service thread. | 03-21-2013 |
20130074101 | SYSTEM AND METHOD FOR SUPPORTING A SERVER-SIDE EVENT MODEL IN A DISTRIBUTED DATA GRID - A system and method can provide a server-side event model in a distributed data grid with a plurality of cluster nodes storing data partitions distributed throughout the cluster, each cluster node being responsible for a set of partitions. The system can map one or more event interceptors to an event dispatcher placed in the cluster. The one or more event interceptors can handle at least one event dispatched from the event dispatcher, wherein the at least one event is associated with an operation in the distributed data grid. The system can defer completion of the operation in the distributed data grid pending completion of the handling of the at least one event by said one or more event interceptors. | 03-21-2013 |
20130097615 | SYSTEM AND METHOD FOR PROVIDING A MESSAGING APPLICATION PROGRAM INTERFACE - A system and method for providing a message bus component or version thereof (referred to herein as an implementation), and a messaging application program interface, for use in an enterprise data center, middleware machine system, or similar environment that includes a plurality of processor nodes together with a high-performance communication fabric (or communication mechanism) such as InfiniBand. In accordance with an embodiment, the messaging application program interface enables features such as asynchronous messaging, low latency, and high data throughput, and supports the use of in-memory data grid, application server, and other middleware components. | 04-18-2013 |
20140108347 | SYSTEM AND METHOD FOR PROVIDING PARTITION PERSISTENT STATE CONSISTENCY IN A DISTRIBUTED DATA GRID - A system and method can provide partition persistent state consistency in a distributed data grid. The distributed data grid can provide a plurality of copies of a partition on a plurality of cluster nodes in the distributed data grid, wherein the plurality of cluster nodes includes a primary owner node and one or more backup nodes for the partition. The primary owner node can propagate one or more modifications of the partition from the primary owner node to the one or more backup nodes. The distributed data grid can ensure consistency among the plurality copies of the partition on the plurality of cluster nodes in the distributed data grid. | 04-17-2014 |
20140108358 | SYSTEM AND METHOD FOR SUPPORTING TRANSIENT PARTITION CONSISTENCY IN A DISTRIBUTED DATA GRID - A system and method can support transient partition consistency in a distributed data grid. A cluster node in the distributed data grid can maintain a storage data structure and an index data structure. The storage data structure can store data in one or more partitions maintained on the cluster node, and the index data structure contains a plurality of indexes, wherein each index supports indexing at least one data grid operation on the one or more partitions. Furthermore, the distributed data grid ensures consistency between the storage data structure and the index data structure for the data stored in the one or more partitions maintained on the cluster node | 04-17-2014 |
20140108532 | SYSTEM AND METHOD FOR SUPPORTING GUARANTEED MULTI-POINT DELIVERY IN A DISTRIBUTED DATA GRID - A system and method can support guaranteed multi-point message delivery in a distributed data grid. A messaging facility in the distributed data grid can receive an incoming message that is adaptive to be delivered to a plurality of nodes in the distributed data grid. The messaging facility can deliver the incoming message to the plurality of nodes according to an order in a list. Furthermore, a node in the plurality of nodes operates to skip a next node in the list to deliver the incoming message, when the next node is dead or unavailable. | 04-17-2014 |
20140108533 | SYSTEM AND METHOD FOR SUPPORTING OUT-OF-ORDER MESSAGE PROCESSING IN A DISTRIBUTED DATA GRID - A system and method can support out-of-order message processing in a distributed data grid. A cluster node in the distributed data grid can receive a plurality of messages at a cluster node in the distributed data grid. The distributed data grid allows each message in the plurality of messages to determine whether it needs to be handled in a particular order on a first thread. The cluster node can dispatch one or more of said messages that do not need to be handled in the particular order on the first thread to one or more different threads. | 04-17-2014 |
20140109110 | SYSTEM AND METHOD FOR SUPPORTING ASYNCHRONOUS MESSAGE PROCESSING IN A DISTRIBUTED DATA GRID - A system and method can support asynchronous message processing in a distributed data grid. A cluster node in the distributed data grid can provide a message processor running on a message processing thread. The message processor can receive a request to process an incoming message from a service thread, wherein the request is associated with a continuation data structure. Then, the message processor can wrap the continuation data structure in a return message after processing the incoming message, and forward the return message to a service queue that is associated with the service thread. | 04-17-2014 |
20150186181 | SYSTEM AND METHOD FOR SUPPORTING FLOW CONTROL IN A DISTRIBUTED DATA GRID - Systems and methods can support flow control in a distributed data grid. The distributed data grid includes a plurality of server nodes that are interconnected with one or more communication channels. The distributed data grid can provide a flow control mechanism, which controls the execution of the tasks in an underlying layer in the distributed data grid. Then, the system allows the client to interact with the flow control mechanism in the distributed data grid, and use the flow control mechanism to configure and execute one or more tasks that are received from the client. | 07-02-2015 |
20150186489 | SYSTEM AND METHOD FOR SUPPORTING ASYNCHRONOUS INVOCATION IN A DISTRIBUTED DATA GRID - Systems and methods can support asynchronous invocation in a distributed data grid with a plurality of server nodes. The system allows a server node in the distributed data grid to receive one or more tasks from a client, wherein said one or more tasks are associated with a unit-of-order. Furthermore, the system can execute said one or more tasks on one or more said server nodes in the distributed data grid, based on the unit-of-order that is guaranteed by the distributed data grid. | 07-02-2015 |