PATENT CLAIM ANALYSIS

Application Number: 15963060
Application Type: Utility
Filing Date: 2018-04
Publication Date: 2018-08
Patent Classification: ["718", "102000"]

Abstract:
Systems and method for a task scheduler with dynamic adjustment of concurrency levels and task granularity are disclosed for improved execution of highly concurrent analytical and transactional systems. The task scheduler can avoid both over commitment and underutilization of computing resources by monitoring and controlling the number of active worker threads. The number of active worker threads can be adapted to avoid underutilization of computing resources by giving the OS control of additional worker threads processing blocked application tasks. The task scheduler can dynamically determine a number of parallel operations for a particular task based on the number of available threads. The number of available worker threads can be determined based on the average availability of worker threads in the recent history of the application. Based on the number of available worker threads, the partitionable operation can be partitioned into a number of sub operations and executed in parallel.

Claim (Index 15):
A system comprising:\n a set of processing units; a non-transitory computer readable medium coupled to the set of processing units and comprising instructions, that when executed by at least one processing unit cause the at least one processing unit to be configured to: process a query in a first thread in a plurality of worker threads to generate a parsing task associated with the query; parse the query based on the parsing task to generate an execution plan comprising a plurality of ordered operations for answering the query; generate a task graph based on the execution plan, the task graph comprising a plurality of task nodes corresponding to the plurality of ordered operations; identify a first task node in the plurality of task nodes corresponding to a first ordered operation in the plurality of ordered operations determined to be partitionable into sub operations for execution in parallel; generate a concurrency level value that corresponds to a number of available worker threads in the plurality of worker threads; and generate a plurality of partitioned tasks for execution in parallel based on the first task node and the concurrency level value.

Metadata:
- Claim Count in Document: 4.0
- Percentile: 91.0
- Lexical Diversity: 2.10811
- Patent Class: 718.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['13925629', '15088810', '14077899', '14054069', '14463863']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.4772713424044061
- 35 USC 102 Novelty (BERT): 0.6423512291496639
- Combined Prediction Score: 0.4937793310789319
- Mean Citation Score: 367.4857159999999
- Max Citation Score: 567.8624
- Similarity Product: 538.915972453308

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