Oracle International Corporation

Bea Systems, Inc.

Workday, Inc.

Jason Howes

Gene Gleyzer

Edward K O'Neil

Sathyanarayana Giridhar

Paul B Patrick

Daryl B Olander

Richard Feit

Mingde Xu

David Byrne

Douglas Dew

Kenneth D Yagen

Mark A Falco

Richard J Riendeau

Robert H Lee

Noah Arliss

Timothy Breeden

Mark Falco

Thomas A Cook

Christopher Jolley

Philip B Griffin

Purushotham Babu Naidu

Brodi Beartusk

Robert Bergman

Scott Musson

Fernand Galiana

Jalpesh Patadia

Ballav Bihani

Manish Devgan

Chris Jolley

Scott Dunbar

A system for a distributed partitioned map reduce includes a plurality of nodes, a plurality of partitions, and a service node. The one or more partitions of the plurality of partitions are stored on a first node of the plurality of nodes. The service node is configured to receive a task from a client application system. The client application system receives a request to perform the task from a requestor. The client application system selects a service node to manage execution of the task. The client application system provides the service node the task. The service node is configured to provide partition task logic to the plurality of partitions. The partition task logic includes a partition task map reduce. The service node is configured to receive partition results from the plurality of partitions, execute a service node reduce to determine a service node result, and provide the service node result.

Distributed partitioned map reduce using a data fabric

A system includes an interface and a processor. The interface is configured to receive an indication that a change has occurred to partition data on a first node, wherein the partition data is stored on a partition on the first node. The processor is configured to: determine whether the change to the partition data causes a change to a predetermined partition result of a set of predetermined partition results stored by the partition; and in response to a determination that the change to partition data affects the predetermined partition result stored by the partition: determine a new value for the predetermined partition result; store the new value; and provide an indication to a service node that the new value for the predetermined partition result has been determined, wherein the service node is selected by a client application system to manage execution of a task.

Distributed real-time partitioned MapReduce for a data fabric

A system for a distributed real time partitioned map reduce includes a plurality of nodes, a service node, and a plurality of partitions. The service node is selected by a client application system to manage execution of a task. One or more partitions of the plurality of partitions are stored on a first node of the plurality of nodes. A partition stored on the first node is configured to receive a request for a partition result from the service node; determine the partition result by querying a set of predetermined partition results stored by the partition; and provide the partition result to the service node.

A system for performing a computation includes an interface and a processor. The interface is configured to receive an indication of the computation. The processor is configured to determine whether the computation is with respect to a computation version number. In response to a determination that the computation is with respect to a computation version number: 1) determine whether the system has been updated to at least the computation version number; and 2) in response to a determination that the system has been updated to at least the computation version number: a) determine a set of data values for the computation associated with the computation version number; b) perform a partition reduce operation on the set of data values to determine a partition result; and c) provide the partition result.

Distributed multi-version partitioned mapreduce for a data fabric

A system and method can support recovery of persisted data from persistent storage of a distributed data grid, and provide persistent store versioning and integrity. A coordinator in the distributed data grid can receive a plurality of identifiers from one or more members of the distributed data grid, wherein each said identifier is associated with a persisted partition in a persistent storage for the distributed data grid. Then, the coordinator can select an identifier for each partition, wherein each selected identifier is associated with a most recent valid version of a partition. Furthermore, the coordinator can determine an active member in the distributed data grid that is responsible for recovering said partition from a persisted partition associated with the selected identifier.

System and method for supporting persistent store versioning and integrity in a distributed data grid

A system and method can support persistence in a distributed data grid. A plurality of members in the distributed data grid can persist a plurality of partitions associated with one or more cache services in persistent storage. Furthermore, a coordinator, which may be a member in the distributed data grid, can synchronize a view of partition ownership among the plurality of members in the distributed data grid, and form a distributed consensus on which partition can be recovered from which member in the distributed data grid.

System and method for supporting persistence partition discovery in a distributed data grid

A system and method for supporting a scalable thread pool in a multi-threaded processing environments such as a distributed data grid. A work distribution system utilizes a collection of association piles to hold elements communicated between a service thread and multiple worker threads. Worker threads associated with the association piles poll elements in parallel. Polled elements are not released until returned from the worker thread. First in first out ordering of operations is maintained with respect to related elements by ensuring related elements are held in the same association pile and preventing polling of related elements until any previously polled and related elements have been released. By partitioning the elements across multiple association piles while ensuring proper ordering of operations with respect to related elements the scalable thread pool enables the use of large thread pools with reduced contention compared to a conventional single producer multiple consumer queue.

System and method for supporting a scalable thread pool in a distributed data grid

A system and method can support persistence in a distributed data grid, such as persistent store versioning and integrity. A resolver in the distributed data grid can receive a plurality of identifiers from one or more members of the distributed data grid, wherein each said identifier is associated with a persisted partition in a persistent storage for the distributed data grid. Then, the resolver can select an identifier for each partition, wherein each selected identifier is associated with a most recent valid version of a partition. Furthermore, the resolver can determine a member in the distributed data grid that is responsible for recovering said partition from a persisted partition associated with the selected identifier.

A system and method supports dynamic thread pool sizing suitable for use in multi-threaded processing environment such as a distributed data grid. Dynamic thread pool resizing utilizes measurements of thread pool throughput and worker thread utilization in combination with analysis of the efficacy of prior thread pool resizing actions to determine whether to add or remove worker threads from a thread pool in a current resizing action. Furthermore, the dynamic thread pool resizing system and method can accelerate or decelerate the iterative resizing analysis and the rate of worker thread addition and removal depending on the needs of the system. Optimizations are incorporated to prevent settling on a local maximum throughput. The dynamic thread pool sizing/resizing system and method thereby provides rapid and responsive adjustment of thread pool size in response to changes in work load and processor availability.

System and method for supporting dynamic thread pool sizing in a distributed data grid

A system and method can support data interoperability in a distributed data grid. The system can provide an acceptor in the distributed data grid, wherein the acceptor is associated with a cache that is based on the distributed data grid. Furthermore, the acceptor can receive incoming data from a first client, which can be a non-native client that is associated with a client application. Additionally, the system allows a second client, which can be a native client associated with the distributed cache, to share the received incoming data with the first client.

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

A system and method can support one or more named operations in a distributed data grid. The distributed data grid includes one or more cluster nodes that can provide the one or more named operations associated with one or more resources in the distributed data grid. The distributed data grid can publish the one or more named operations to a client. Furthermore, the distributed data grid can perform the one or more named operations in the distributed data grid upon receiving a request from a client.

System and method for supporting named operations in a distributed data grid

A method for rendering a graphical user interface (GUI), comprising providing for the representation of the GUI as a set of objects wherein the objects are organized in a logical hierarchy, associating a theme with a first object in the set of objects, rendering the first object according to the theme, rendering any descendents of the first object according to the theme, wherein any descendents of the first object can override the theme, and wherein one of the set of objects can communicate with another of the set of objects.

Method for utilizing look and feel in a graphical user interface

A method for accepting a request, comprising mapping the request to a control tree factory, generating a control tree from the factory based on the request wherein the control tree can include at least one control, advancing the control tree through at least one lifecycle stage based on the request, generating a response wherein the response can be used to render at least a portion of a graphical user interface (GUI), and wherein the at least one control can represent a graphical element of the GUI.

Control-based graphical user interface framework

A system and method for accepting a communication, comprising providing the communication to a controller, associating a model with said communication, determining a state of the model based on said communication, providing a view based on the state of the model, and wherein the view is a page in a page group.

Growing community of inventors

Somerville, MA, United States of America

Jason Howes