PATENT CLAIM ANALYSIS

Application Number: 16115210
Application Type: Utility
Filing Date: 2018-08
Publication Date: 2018-12
Patent Classification: ["718", "105000"]

Abstract:
Embodiments for leveraging directed acyclic graph (DAG) information to group tasks for execution, by at least one processor. An Input/Output (I/O) cost for each task in a set of tasks determined to be within a same input host set is determined, and tasks within the set of tasks are grouped into task groups according to an applied allocation time. The task groups are launched commensurate with a calculated delay time from each input host set so as to overlap I/O phases and central processing unit (CPU) phases to improve CPU efficiency. The launched task groups are executed by an executor according to the calculated delay time.

Claim (Index 19):
The computer program product of  claim 17 , wherein the applied allocation time comprises a round trip time between the driver and a cluster manager including a time period from a task request sent to a first resource allocation received, the time period then weighted with all previous task requests.

Metadata:
- Claim Count in Document: 53.0
- Percentile: 96.0
- Lexical Diversity: 1.73529
- Patent Class: 718.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['15491060', '15628850', '15070979', '15157683', '15157637']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3975839805635403
- 35 USC 102 Novelty (BERT): 0.5459611914833751
- Combined Prediction Score: 0.4124217016555238
- Mean Citation Score: 187.482978
- Max Citation Score: 327.59103
- Similarity Product: 315.37579283206344

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

Dataset: test