Oracle International Corporation

Workday, Inc.

Brian Oliver

Noah Arliss

Paul F Mackin

Patrick Peralta

Robert H Lee

Gene Gleyzer

Jonathan Knight

Mark Falco

Ballav Bihani

Christer Fahlgren

Edwin Roberts Misek

Chen Liu

A system for determining a dependency task tree includes an interface and a processor. The interface is configured to receive a task list. The task list is associated with compiling, testing, packaging, and/or deploying a program. The processor is configured to determine a dependency task tree. The dependency task tree includes all tasks in the task list and all prerequisite tasks for each task in the task list and provides the dependency task tree. The interface is configured to receive the dependency task tree. The processor is configured to determine a set of tasks such that a task of the set of tasks does not depend on any other task; add the set of tasks to a task queue; in response to determining that all dependencies of the dependent task are completed; and continue executing tasks from the task queue until all tasks in the dependency task tree are completed.

Program inference and execution for automated compilation, testing, and packaging of applications

A system for discovering a task list includes an interface and a processor. The interface is configured to receive an indication of a start directory and a set of plugins, wherein the set of plugins is used to determine the task list associated with compiling, testing, packaging, and/or deploying a program. The processor is configured to determine a set of directories for discovering the task list based at least in part on the start directory; for each directory of the set of directories: for each plugin of the set of plugins: apply a selected plugin of the set of plugins to a selected directory of the set of directories to generate a set of tasks; add the set of tasks to the task list; and provide the task list.

Project discovery for automated compilation, testing, and packaging of applications

A system and method for providing store and forward messaging on a partitioned cache provided by a distributed data grid. The store and forward message system implements publish and subscribe semantics in a way that distributed messages over the partitions of the distributed cache, reduces contention and makes efficient use of processor and network resources.

System and method for topics implementation in a distributed data computing environment

A system and method can support federation replication in a distributed computing environment. The system can provide one or more federation replication channels between a plurality of members in a first cluster and a plurality of members in a second cluster. Furthermore, a replication request can be transmitted from a federation coordinator to the plurality of members in the first cluster, wherein each said member in the first cluster owns a set of partitions. Then, the aggregated data for each said partition in the first cluster can be sent to the plurality of members in the second cluster via said one or more federation replication channels. Additionally, using the second cluster, the system can take a persistent snapshot of information on the plurality of members in the first cluster while the first cluster is operational.

System and method for supporting data grid snapshot and federation

A system and method can support resettable acknowledgements for synchronizing data between clusters in a distributed data grid. The system can use one or more unique identifiers (IDs) to support message passing between different clusters in the distributed data grid. A first cluster can receive a first replication message from a second cluster, wherein the replication message indicates that the replication message is from a new cluster. Then, the system can reset the first cluster to preserve idempotence in possessing one or more replication messages that are received from the second cluster, following the first replication message.

System and method for supporting resettable acknowledgements for synchronizing data in a distributed data grid

A system and method can support a distributed data structure in a distributed data grid. The distributed data grid includes a plurality of buckets, wherein each said bucket is configured with a capacity to contain a number of elements in the distributed data structure. Furthermore, the distributed data grid includes a state owner process, which is configured to hold state information for the distributed data structure and provides the state information for the distributed data structure to a client process.

System and method for supporting a distributed data structure in a distributed data grid

A system and method can support a distributed queue in a distributed data grid. The distributed queue can include a queue of buckets stored on a plurality of processes, wherein each said bucket is configured to contain a number of elements of the distibuted queue. Furthermore, the distributed queue can include a named queue that holds a local version of a state information for the distributed queue, wherein said local version of the state information contains a head pointer and a tail pointer to the queue of buckets in the distributed data grid.

System and method for providing a distributed queue in a distributed data grid

An event distribution pattern is described for use with a distributed data grid. The grid can be comprised of a cluster of computer devices having a cache for storing data entries. An event distributor residing on at least one of those computer devices provides a domain for sending events to a desired end point destination and also provides the store and forward semantics for ensuring asynchronous delivery of those events. An event channel controller resides as an entry in the cache on at least one of computers in the cluster. This event channel controller receives the events defined by said application from the event distributor and provides the events to a set of event channels. Each event channel controller can include multiple event channel implementations for distributing the events to different destinations. The destinations can include local caches, remote caches, standard streams, files and JMS components.

Event distribution pattern for use with a distributed data grid

A system and method can support partition level journaling for synchronizing data between clusters in a distributed data grid. The system can associate a journal cache with one or more user caches in a local cluster, wherein said one or more user caches are split into a plurality of partitions. Furthermore, the system can capture one or more data changes that are applied to different partitions of said one or more user caches, and can store said one or more data changes in the journal cache that supports synchronization with remote clusters.

System and method for supporting partition level journaling for synchronizing data in a distributed data grid

A system and method can support failover during synchronization between autonomous clusters in a distributed data grid. The system allows a cluster member in a source cluster to take over as an owner of a partition in a source cluster, when another cluster member in the source cluster becomes unavailable. Then, a cluster member in the destination cluster can receive one or more replication messages from said cluster member in the source cluster, wherein said one or more replication messages include one or more data changes. Furthermore, the cluster member in the destination cluster may ignore said one or more replication messages, if said one or more replication messages have already been received and successfully processed in the destination cluster.

System and method for supporting failover during synchronization between clusters in a distributed data grid

A system and method can support parallel asynchronous synchronization between autonomous clusters in a distributed data grid. The system can track one or more data changes, which are applied on one or more user caches in a source cluster, at a partition level. Furthermore, one or more cluster members in the source cluster can send one or more replication messages to one or more destination clusters, wherein said one or more replication messages include the one or more data changes. Then, the one or more destination clusters can process the received one or more data changes.

System and method for supporting parallel asynchronous synchronization between clusters 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.

System and method for handling storage events in a distributed data grid

A server-side event model provides a general-purpose event framework which simplifies the server-side programming model in a distributed data grid storing data partitions distributed throughout a cluster of nodes. A system provides event interceptors which handle events associated with operations and maps the event interceptors to event dispatchers placed in the cluster. Advantageously, the system supports handling critical path events without the need for interactions from the client-side thereby avoiding unnecessary delays waiting for client responses. Additionally, the system can defer completion of an operation in the distributed data grid pending completion of event handling by an event interceptor. The system enables the data grid to employ more types of events and define different event interceptors for handling the events while avoiding client interaction overhead.

System and method for supporting a server-side event model in a distributed data grid

A processing pattern is described for dispatching and executing tasks in a distributed computing grid, such as a cluster network. The grid includes a plurality of computer nodes that store a set of data and perform operations on that data. The grid provides an interface that allows clients to submit tasks to the cluster for processing. The interface can be used to establish a session between the client and the cluster, which will be used to submit a task for processing by the plurality of computer nodes of the cluster. A dispatcher receives a submission of the task over the interface and routes the task to at least one node in the cluster that is designated to process the task. A task processor then processes the task on the designated node(s), generates a submission outcome and indicates to the client that the submission outcome is available.

Growing community of inventors

Acton, MA, United States of America

Brian Oliver