PATENT CLAIM ANALYSIS

Application Number: 16042205
Application Type: Utility
Filing Date: 2018-07
Publication Date: 2018-11
Patent Classification: ["717", "140000"]

Abstract:
A received graph-based program specification includes: a plurality of components, each corresponding to at least one operation; and a plurality of directed links each connecting an upstream component to a downstream component. Processed code is generated representing one or more groups of operations by: identifying a possible level of concurrency in a first group of operations based at least in part on a topology of the graph, such that multiple operations in the first group are not prevented by the topology of the graph from executing concurrently; analyzing at least some of the operations in the first group to determine runtime characteristics associated with the analyzed operations; and generating processed code for executing the operations, where the processed code enforces a reduced level of concurrency in the first group, lower than the identified possible level of concurrency, based at least in part on the determined runtime characteristics.

Claim (Index 15):
A computing system for compiling a graph-based program specification, the computing system including:\n means for receiving the graph-based program specification, the graph-based program specification including a graph that includes:\n a plurality of components, each corresponding to a operation; and \n a plurality of directed links, each directed link connecting an upstream component of the plurality of components to a downstream component of the plurality of components; and \n means for processing the graph-based program specification to generate processed code representing one or more groups of operations, the processing including:\n identifying a possible level of concurrency in a first group of the operations based at least in part on a topology of the graph, such that multiple operations in the first group are not prevented by the topology of the graph from executing concurrently; \n analyzing at least some of the operations in the first group to determine runtime characteristics associated with the analyzed operations, the analyzing including, for each of the analyzed operations, determining if that analyzed operation is a latent operation that potentially performs a computation over a period of time that is larger than a first threshold or that potentially waits for a response for a period of time that is larger than the first threshold; and \n generating processed code for executing the operations in the first group, where the processed code enforces a reduced level of concurrency in the first group, lower than the identified possible level of concurrency, unless at least two operations in the first group that are not prevented by the topology of the graph from executing concurrently were both determined to be latent operations.

Metadata:
- Claim Count in Document: 33.0
- Percentile: 95.0
- Lexical Diversity: 2.01266
- Patent Class: 717.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['15234197', '14843026', '14843120', '14843162', '14843001']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.4305084962865232
- 35 USC 102 Novelty (BERT): 0.5987294732065518
- Combined Prediction Score: 0.4473305939785261
- Mean Citation Score: 325.7035939999999
- Max Citation Score: 500.0763
- Similarity Product: 429.3476074568689

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

Dataset: test