Nicholas T Roth

US Patent:

20190205178, Jul 4, 2019

Filed:

Mar 14, 2019

Appl. No.:

16/353050

Inventors:

- Redwood Shores CA, US
Siegfried Depner - Sunnyvale CA, US
Nicholas Roth - San Jose CA, US
Thomas Manhardt - San Carlos CA, US
Hassan Chafi - San Mateo CA, US

International Classification:

G06F 9/50
G06F 9/54

Abstract:

Techniques herein provide job control and synchronization of distributed graph-processing jobs. In an embodiment, a computer system maintains an input queue of graph processing jobs. In response to de-queuing a graph processing job, a master thread partitions the graph processing job into distributed jobs. Each distributed job has a sequence of processing phases. The master thread sends each distributed job to a distributed processor. Each distributed job executes a first processing phase of its sequence of processing phases. To the master thread, the distributed job announces completion of its first processing phase. The master thread detects that all distributed jobs have announced finishing their first processing phase. The master thread broadcasts a notification to the distributed jobs that indicates that all distributed jobs have finished their first processing phase. Receiving that notification causes the distributed jobs to execute their second processing phase. Queues and barriers provide for faults and cancellation.

US Patent:

20190171490, Jun 6, 2019

Filed:

Feb 7, 2019

Appl. No.:

16/270135

Inventors:

- Redwood Shores CA, US
Siegfried Depner - Sunnyvale CA, US
Jinsu Lee - San Mateo CA, US
Nicholas Roth - San Jose CA, US
Hassan Chafi - San Mateo CA, US

International Classification:

G06F 9/50
H04L 29/08

Abstract:

Techniques are provided for dynamically self-balancing communication and computation. In an embodiment, each partition of application data is stored on a respective computer of a cluster. The application is divided into distributed jobs, each of which corresponds to a partition. Each distributed job is hosted on the computer that hosts the corresponding data partition. Each computer divides its distributed job into computation tasks. Each computer has a pool of threads that execute the computation tasks. During execution, one computer receives a data access request from another computer. The data access request is executed by a thread of the pool. Threads of the pool are bimodal and may be repurposed between communication and computation, depending on workload. Each computer individually detects completion of its computation tasks. Each computer informs a central computer that its distributed job has finished. The central computer detects when all distributed jobs of the application have terminated.

US Patent:

20180352026, Dec 6, 2018

Filed:

May 30, 2017

Appl. No.:

15/607985

Inventors:

- Redwood Shores CA, US
Thomas Manhardt - Augsburg, DE
Jinsu Lee - San Mateo CA, US
Nicholas Roth - San Jose CA, US
Hassan Chafi - San Mateo CA, US

International Classification:

H04L 29/08
G06F 9/38
G06F 3/00
H04L 9/06

Abstract:

Techniques minimize communication while loading a graph. In a distributed embodiment, each computer loads some edges of the graph. Each edge connects a source vertex (SV) to a destination vertex. For each SV of the edges, the computer hashes the SV to detect a tracking computer (TrC) that tracks on which computer does the SV reside. Each computer informs the TrC that the SV originates an edge that resides on that computer. For each SV, the TrC detects that the SV originates edges that reside on multiple providing computers (PCs). The TrC selects a target computer (TaC) from the multiple PCs to host the SV. The TrC instructs each PC, excluding the TaC, to transfer the SV and related edges that are connected to the SV to the TaC. A vertex's internal identifier indicates which computer hosts the vertex. The TrC maintains a mapping between external and internal identifiers.

US Patent:

20180210761, Jul 26, 2018

Filed:

Jan 24, 2017

Appl. No.:

15/413811

Inventors:

- Redwood Shores CA, US
Siegfried Depner - Sunnyvale CA, US
Nicholas Roth - San Jose CA, US
Thomas Manhardt - San Carlos CA, US
Hassan Chafi - San Mateo CA, US

International Classification:

G06F 9/50
G06F 9/48

Abstract:

Techniques herein provide job control and synchronization of distributed graph-processing jobs. In an embodiment, a computer system maintains an input queue of graph processing jobs. In response to de-queuing a graph processing job, a master thread partitions the graph processing job into distributed jobs. Each distributed job has a sequence of processing phases. The master thread sends each distributed job to a distributed processor. Each distributed job executes a first processing phase of its sequence of processing phases. To the master thread, the distributed job announces completion of its first processing phase. The master thread detects that all distributed jobs have announced finishing their first processing phase. The master thread broadcasts a notification to the distributed jobs that indicates that all distributed jobs have finished their first processing phase. Receiving that notification causes the distributed jobs to execute their second processing phase. Queues and barriers provide for faults and cancellation.

US Patent:

20170351551, Dec 7, 2017

Filed:

Jun 7, 2016

Appl. No.:

15/175920

Inventors:

- Redwood Shores CA, US
Siegfried Depner - Sunnyvale CA, US
Jinsu Lee - San Mateo CA, US
Nicholas Roth - San Jose CA, US
Hassan Chafi - San Mateo CA, US

International Classification:

G06F 9/50

Abstract:

Techniques are provided for dynamically self-balancing communication and computation. In an embodiment, each partition of application data is stored on a respective computer of a cluster. The application is divided into distributed jobs, each of which corresponds to a partition. Each distributed job is hosted on the computer that hosts the corresponding data partition. Each computer divides its distributed job into computation tasks. Each computer has a pool of threads that execute the computation tasks. During execution, one computer receives a data access request from another computer. The data access request is executed by a thread of the pool. Threads of the pool are bimodal and may be repurposed between communication and computation, depending on workload. Each computer individually detects completion of its computation tasks. Each computer informs a central computer that its distributed job has finished. The central computer detects when all distributed jobs of the application have terminated.