PATENT CLAIM ANALYSIS

Application Number: 16206942
Application Type: Utility
Filing Date: 2018-11
Publication Date: 2019-06
Patent Classification: ["709", "201000"]

Abstract:
Hierarchical dynamic scheduling is disclosed. A plurality of physical nodes is included in a computer system. Each node includes a plurality of processors. Each processor includes a plurality of hyperthreads. An abstraction of the nodes, processors, and hyperthreads forms a hierarchy. Upon receiving an indication that a hyperthread should be assigned, a dynamic search of the hierarchy is performed, beginning at the leaf level, for a process to assign to the hyperthread.

Claim (Index 14):
The method of  claim 13  wherein the indication is received in response to the the core or the hyperthread becoming available for assignment.

Metadata:
- Claim Count in Document: 39.0
- Percentile: 98.0
- Lexical Diversity: 1.72917
- Patent Class: 709.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['13830160', '13830094', '15429638', '15687172', '15687173']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.2871224885280057
- 35 USC 102 Novelty (BERT): 0.5220248483214485
- Combined Prediction Score: 0.31061272450735
- Mean Citation Score: 266.723054
- Max Citation Score: 319.1713299999999
- Similarity Product: 183.98263842367464

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

Dataset: test