Mark J Falco, 76349 Ash St, Chestnut Hill, CT 06226

2012019, Aug 2, 2012

Jan 17, 2012

13/352195

Mark Falco - Burlington MA, US
Robert H. Lee - San Carlos CA, US
Harvey Eneman - Belmont CA, US
Gene Gleyzer - Lexington MA, US
Cameron Purdy - Lexington MA, US
Alex Gleyzer - Waltham MA, US

ORACLE INTERNATIONAL CORPORATION - Redwood Shores CA

G06F 15/173

709224

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.

2013004, Feb 14, 2013

May 16, 2012

13/473432

Mark Falco - Burlington MA, US
Patrik Torstensson - Stockholm, SE
Gene Gleyzer - Lexington MA, US
Cameron Purdy - Lexington MA, US

ORACLE INTERNATIONAL CORPORATION - REDWOOD SHORES CA

G06F 9/54
G06F 15/167

709212, 719313

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.

2017000, Jan 5, 2017

Jul 1, 2016

15/200908

- Redwood Shores CA, US
MARK FALCO - BURLINGTON MA, US

G06F 3/06

A distributed computing environment is provided with a system and method for supporting rare copy-on-write data access. The system operates a data structure in a read only pattern suitable for serving a plurality of read requests with reduced overhead. The system, upon receiving a write request, creates a copy of data to execute the write request. The system defers writing the mutated data back to the read-only data structure. The system thus allows for multiple mutations to be made to the copy of the data using a read/write access pattern. After a number of read-only requests are received, the mutated data is written back to the read-only data structure. A monitor counts read and write requests in order to reduce overall read/write overhead and enhance performance of the distributed data grid.

2017000, Jan 5, 2017

Jul 1, 2016

15/200892

- Redwood Shores CA, US
GENE GLEYZER - LEXINGTON MA, US
MARK FALCO - BURLINGTON MA, US

G06F 9/50

A system and method for supporting an association-aware executor service in a distributed computing environment comprising. The system can provide an executor service associated with a thread pool, the thread pool containing a plurality of threads. The system can receive, at the executor service, a plurality of work requests, each work request being associated with a key of a plurality of keys. The system can define groups of work requests, each group of work requests comprising one or more work requests having a same key. The system can queue, on the plurality of threads in the thread pool, the groups of work requests, each group of work requests being queued on a different thread. All work requests in a particular group are executed on the same thread.

2017000, Jan 5, 2017

Jul 1, 2016

15/200897

- Redwood Shores CA, US
MARK FALCO - BURLINGTON MA, US

H04L 12/24
H04L 12/26
H04L 29/08

A system and method for supporting universal timeout in a distributed computing environment. The universal timeout feature can enforce a defined timeout for a block (or group of blocks) or code executing on a thread regardless of the number of network hops required to effectuate the code. The universal timeout feature allows a thread to express a timeout which is respected across the platform thereby improving timeout functionality compared to prior timeout implementations which pass a timeout between functions. Universal timeout may be implemented using a try-with-resources paradigm where the timeout period is treated as a resource.

2016007, Mar 17, 2016

Sep 16, 2015

14/856114

- Redwood Shores CA, US
Mark Falco - Burlington MA, US

G06F 3/06
G06F 12/12

A system and method which supports a low contention queue in a multithreaded processing environment such as a distributed data grid. The queue is optimized to reduce memory contention and queue processing overhead, and is lock-free. The queue includes a doubly-linked list of nodes, wherein each node is associated with a value, a reference to a next node and a reference to a previous node. Furthermore, the queue allows one or more consumer threads to access the queue via a reference to a last removed node from the doubly linked list, and allows one or more producer threads to insert a new node via a reference to a tail node in the doubly-linked list. The low queue efficiently serves large number of threads with reduced contention, overhead, and latency, thereby improving performance in a multithreaded processing environment such as a distributed data grid.

2016007, Mar 17, 2016

Sep 16, 2015

14/856106

- Redwood Shores CA, US
Mark Falco - Burlington MA, US

G06F 9/46
G06F 9/48
G06F 9/30
G06F 9/50

A scalable concurrent queue includes a central queue associated with multiple temporary queues for holding batches of nodes from multiple producers. When a producer thread or service performs an insertion operation on the scalable concurrent queue, the producer inserts one or more nodes into a batch in one of the multiple temporary queues associated with the central queue. Subsequently, the producer (or another producer) inserts the batch held in the temporary queue into the central queue. Contention between the multiple producers is reduced by providing multiple temporary queues into which the producers may insert nodes, and also by inserting nodes in the central queue in batches rather than one node at a time. The scalable concurrent queue scales to serve large number of producers with reduced contention thereby improving performance in a distributed data grid.

2016007, Mar 17, 2016

Sep 16, 2015

14/856367

- Redwood Shores CA, US
Mark Falco - Burlington MA, US

G06F 9/52

A system and method for cooperative notification offloading supports thread notification offloading in a multi-threaded messaging system such as a distributed data grid. Pending notifiers are maintained in a collection of pending notifiers. A signaling thread processes a first notifier in the collection of pending notifiers to wake a first thread. The first awoken thread processes additional notifiers in the collection of pending notifiers to wake additional threads. The additional awoken threads can process additional notifiers in a cycle until all pending notifiers in the collection are processed. Such cooperative notification offloading of notifier processing from the signaling thread improves performance of the signaling thread with respect to other tasks thereby improving performance of the signaling thread and the distributed data grid.