PATENT CLAIM ANALYSIS

Application Number: 15965745
Application Type: Utility
Filing Date: 2018-04
Publication Date: 2018-08
Patent Classification: ["706", "025000"]

Abstract:
Methods, systems, and apparatus, including computer programs encoded on computer storage media, for modifying a computational graph to include send and receive nodes. Communication between unique devices performing operations of different subgraphs of the computational graph can be handled efficiently by inserting send and receive nodes into each subgraph. When executed, the operations that these send and receive nodes represent may enable pairs of unique devices to conduct communication with each other in a self-sufficient manner. This shifts the burden of coordinating communication away from the backend, which affords the system that processes this computational graph representation the opportunity to perform one or more other processes while devices are executing subgraphs.

Claim (Index 10):
A system comprising:\n one or more data processing apparatus; and a computer-readable storage device having stored thereon instructions that, when executed by the one or more data processing apparatus, cause the one or more data processing apparatus to perform operations comprising:\n obtaining data representing a computational graph, the computational graph comprising a plurality of nodes and directed edges, wherein each node represents a respective operation, and wherein each directed edge connects a respective first node to a respective second node that represents an operation that receives, as input, an output of an operation represented by the respective first node; \n obtaining data identifying an allocation of the computational graph across a plurality of devices, wherein the allocation assigns each node in the computational graph to a respective device of the plurality of devices; \n identifying one or more cross-device directed edges in the computational graph, wherein each cross-device directed edge is a directed edge that connects a respective first node to a respective second node that is assigned to a different device than the respective first node in the allocation; \n for each cross-device directed edge:\n inserting a send node between the respective first node and the respective second node in the computational graph, \n inserting a receive node between the send node and the respective second node in the operation graph, and \n modifying the allocation to assign the send node to the same device as the respective first node and the receive node to the same device as the respective second node; and \n \n assigning the operations represented by the nodes in the computational graph to the plurality of devices according to the modified allocation.

Metadata:
- Claim Count in Document: 50.0
- Percentile: 91.0
- Lexical Diversity: 1.55128
- Patent Class: 706.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['15965742', '15965670', '15400942', '15685055', '15400937']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3877303503885597
- 35 USC 102 Novelty (BERT): 0.4960990326306934
- Combined Prediction Score: 0.398567218612773
- Mean Citation Score: 234.71224600000005
- Max Citation Score: 294.50504
- Similarity Product: 270.4247487978268

Labels:
- Claim Label 101: 0
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 0
- Label 101 Adjusted: 0

Dataset: test