PATENT CLAIM ANALYSIS

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

Abstract:
NUMA-aware reader-writer locks may leverage lock cohorting techniques that introduce a synthetic level into the lock hierarchy (e.g., one whose nodes do not correspond to the system topology). The synthetic level may include a global reader lock and a global writer lock. A writer thread may acquire a node-level writer lock, then the global writer lock, and then the top-level lock, after which it may access a critical section protected by the lock. The writer may release the lock (if an upper bound on consecutive writers has been met), or may pass the lock to another writer (on the same node or a different node, according to a fairness policy). A reader may acquire the global reader lock (whether or not node-level reader locks are present), and then the top-level lock. However, readers may only hold these locks long enough to increment reader counts associated with them.

Claim (Index 33):
The method of  claim 31 ,\n wherein the upper bound on the number of consecutive reader threads that hold the reader-writer lock and the upper bound on the number of consecutive writer threads that hold the reader-writer lock have different values.

Metadata:
- Claim Count in Document: 5.0
- Percentile: 96.0
- Lexical Diversity: 1.98824
- Patent Class: 718.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['15012505', '13458868', '14246975', '13458871', '15156110']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.522670917343557
- 35 USC 102 Novelty (BERT): 0.6110005115211582
- Combined Prediction Score: 0.5315038767613172
- Mean Citation Score: 442.831568
- Max Citation Score: 587.28827
- Similarity Product: 380.12775658906463

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

Dataset: test