Noah Arliss Phones & Addresses
-
San Francisco, CA
-
Stoughton, MA
-
82 Cliffe Ave, Lexington, MA 02420
-
63 Westview St, Lexington, MA 02421 (781) 652-0070
-
San Carlos, CA
-
Stow, MA
-
Arlington, MA
-
Waltham, MA
-
Manchester, NH
Work
Position:
Professional/Technical
Education
Degree:
High school graduate or higher
Publications
Us Patents
Processing Pattern Framework For Dispatching And Executing Tasks In A Distributed Computing Grid
View pageUS Patent:
20120197959, Aug 2, 2012
Filed:
Jan 26, 2012
Appl. No.:
13/359391
Inventors:
Brian Oliver - Acton MA, US
Christer Fahlgren - San Francisco CA, US
Noah Arliss - Lexington MA, US
Christer Fahlgren - San Francisco CA, US
Noah Arliss - Lexington MA, US
Assignee:
ORACLE INTERNATIONAL CORPORATION - Redwood Shores CA
International Classification:
G06F 15/16
G06F 9/48
G06F 9/48
US Classification:
709201
Abstract:
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.
Live Object Pattern For Use With A Distributed Cache
View pageUS Patent:
20120278422, Nov 1, 2012
Filed:
Jan 26, 2012
Appl. No.:
13/359399
Inventors:
Brian Oliver - Acton MA, US
Noah Arliss - Lexington MA, US
Noah Arliss - Lexington MA, US
Assignee:
ORACLE INTERNATIONAL CORPORATION - Redwood Shores CA
International Classification:
G06F 15/167
US Classification:
709212
Abstract:
A live object pattern is described that enables a distributed cache to store live objects as data entries thereon. A live object is a data entry stored in the distributed cache which represents a particular function or responsibility. When a live object arrives to the cache on a particular cluster server, a set of interfaces are called back which inform the live object that it has arrived at that server and that it should initiate to perform its functions. A live object is thus different from “dead” data entries because a live object performs a set of function, can be started/stopped and can interact with other live objects in the distributed cache. Because live objects are backed up across the cluster just like normal data entries, the functional components of the system are more highly available and are easily transferred to another server's cache in case of failures.
Event Distribution Pattern For Use With A Distributed Data Grid
View pageUS Patent:
20120278817, Nov 1, 2012
Filed:
Jan 26, 2012
Appl. No.:
13/359396
Inventors:
Brian Oliver - Acton MA, US
Noah Arliss - Lexington MA, US
Noah Arliss - Lexington MA, US
Assignee:
ORACLE INTERNATIONAL CORPORATION - Redwood Shores CA
International Classification:
G06F 9/54
US Classification:
719318
Abstract:
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
System And Method For Handling Storage Events In A Distributed Data Grid
View pageUS Patent:
20130074083, Mar 21, 2013
Filed:
May 2, 2012
Appl. No.:
13/462720
Inventors:
Brian Oliver - Acton MA, US
Noah Arliss - Lexington MA, US
Gene Gleyzer - Lexington MA, US
Robert H. Lee - San Carlos CA, US
Noah Arliss - Lexington MA, US
Gene Gleyzer - Lexington MA, US
Robert H. Lee - San Carlos CA, US
Assignee:
ORACLE INTERNATIONAL CORPORATION - Redwood Shores CA
International Classification:
G06F 9/46
US Classification:
718102, 719318
Abstract:
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 Supporting A Server-Side Event Model In A Distributed Data Grid
View pageUS Patent:
20130074101, Mar 21, 2013
Filed:
May 2, 2012
Appl. No.:
13/462719
Inventors:
Brian Oliver - Acton MA, US
Noah Arliss - Lexington MA, US
Gene Gleyzer - Lexington MA, US
Robert H. Lee - San Carlos CA, US
Noah Arliss - Lexington MA, US
Gene Gleyzer - Lexington MA, US
Robert H. Lee - San Carlos CA, US
Assignee:
ORACLE INTERNATIONAL CORPORATION - Redwood Shores CA
International Classification:
G06F 9/46
US Classification:
719318
Abstract:
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.
Push Replication For Use With A Distributed Data Grid
View pageUS Patent:
20120197840, Aug 2, 2012
Filed:
Jan 27, 2012
Appl. No.:
13/360487
Inventors:
Brian Oliver - Acton MA, US
Noah Arliss - Lexington MA, US
Noah Arliss - Lexington MA, US
Assignee:
ORACLE INTERNATIONAL CORPORATION - Redwood Shores CA
International Classification:
G06F 7/00
US Classification:
707613, 707E17005, 707E17032
Abstract:
Push replication techniques are described for use in an in-memory data grid. When applications on a cluster perform insert, update or delete operations in the cache, a push replication provider asynchronously pushes updates from the source cluster to one or more remote destination clusters. The push replication provider includes a pluggable internal transport to send the updates to the destination cluster. This pluggable transport can be switched to employ a different communication service or protocol. A publishing transformer can chain multiple filters and apply filters on a stream of updates from source cluster to the destination cluster. A batch publisher can be used to receive batches multiple updates and replicate those batch to the destination cluster. XML based configuration can be provided to configure the push replication techniques on a cluster. A number of cluster topologies can be utilized, including active/passive, active/active, multi-site active/passive, multi-site active/active and centralized replication arrangement.
Distributed Real-Time Partitioned Mapreduce For A Data Fabric
View pageUS Patent:
20210224279, Jul 22, 2021
Filed:
Apr 2, 2021
Appl. No.:
17/221163
Inventors:
- Pleasanton CA, US
Noah Arliss - Lexington MA, US
Noah Arliss - Lexington MA, US
International Classification:
G06F 16/2455
G06F 16/2453
G06F 16/2453
Abstract:
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 Partitioned Map Reduce Using A Data Fabric
View pageUS Patent:
20190222633, Jul 18, 2019
Filed:
Jan 12, 2018
Appl. No.:
15/870407
Inventors:
- Pleasanton CA, US
Noah Arliss - Lexington MA, US
Noah Arliss - Lexington MA, US
International Classification:
H04L 29/08
Abstract:
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.