Dynamic core allocation for consistent performance in a non-preemptive scheduling environment
US-2017177221-A1 · Jun 22, 2017 · US
US10185592B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10185592-B2 |
| Application number | US-201715463938-A |
| Country | US |
| Kind code | B2 |
| Filing date | Mar 20, 2017 |
| Priority date | Sep 30, 2014 |
| Publication date | Jan 22, 2019 |
| Grant date | Jan 22, 2019 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Methods, systems, and computer programs are presented for allocating CPU cycles and disk Input/Output's (IOs) to resource-creating processes based on dynamic weights that change according to the current percentage of resource utilization in the storage device. One method includes operations for assigning a first weight to a processing task that increases resource utilization of a resource for processing incoming input/output (IO) requests, and for assigning a second weight to a generating task that decreases the resource utilization of the resource. Further, the method includes an operation for dynamically adjusting the second weight based on the current resource utilization in the storage system. Additionally, the method includes an operation for allocating the CPU cycles and disk IOs to the processing task and to the generating task based on their respective first weight and second weight.
Opening claim text (preview).
What is claimed is: 1. A method for allocating CPU (central processing unit) cycles and disk IOs of a storage system, the method comprising: assigning, by a processor of a computing device, a first weight to a processing task that increases resource utilization of a resource for processing incoming input/output (IO) requests; assigning, by the processor, a second weight to a generating task that decreases the resource utilization of the resource; dynamically adjusting, by the processor, the second weight of the generating task based on a current resource utilization in the storage system, including: varying a value to the second weight when the current resource utilization is between a first predetermined threshold and a second predetermined threshold, and maintaining the value of the second weight at a constant level when the current resource utilization is below the first predetermined threshold or above the second predetermined threshold; and allocating, by the processor, the CPU cycles and disk IOs to the processing task and to the generating task based on their respective first weight and second weight. 2. The method of claim 1 , wherein the dynamically adjusting the second weight further comprises: varying the second weight between a first value and a second value when the current resource utilization is between the first predetermined threshold and the second predetermined threshold, wherein the second predetermined threshold is greater than the first predetermined threshold. 3. The method of claim 2 , wherein maintaining the value of the second weight at a constant level comprises: maintaining the second weight at the first value when the current resource utilization in the storage system is less than the first predetermined threshold. 4. The method of claim 2 , wherein maintaining the value of the second weight at a constant level comprises: maintaining the second weight at the second value when the current resource utilization in the storage system is greater than the second predetermined threshold. 5. The method of claim 2 , wherein the value of the second weight grows linearly from the first value to the second value when the current resource utilization is between the first predetermined threshold and the second predetermined threshold. 6. The method of claim 2 , wherein the value of the second weight grows exponentially from the first value to the second value when the current resource utilization is between the first predetermined threshold and the second predetermined threshold. 7. The method of claim 2 , wherein the value of the second weight grows in a step function from the first value to the second value when the current resource utilization is between the first predetermined threshold and the second predetermined threshold. 8. The method of claim 2 , further comprising: adding a first new instance of the generating task when the current resource utilization is greater than the first predetermined threshold; and adding a second new instance of the generating task when the current resource utilization exceeds a third threshold that is greater than the first predetermined threshold. 9. A storage system comprising: a non-volatile memory (NVRAM) for storing incoming input/output (IO) requests; a storage drive for permanent data storage; and a central processing unit (CPU), wherein a processing task and a generating task are executed by the CPU, the processing task increasing resource utilization of a resource for processing incoming IO requests, the generating task decreasing the resource utilization of the resource, wherein a CPU scheduler and a disk scheduler assign a first priority weight to the processing task and a second priority weight to the generating task, wherein the CPU scheduler and the disk scheduler dynamically adjust the second weight based on a current resource utilization in the storage system, including: varying a value to the second weight when the current resource utilization is between a first predetermined threshold and a second predetermined threshold, and maintaining the value of the second weight at a constant level when the current resource utilization is below the first predetermined threshold or above the second predetermined threshold, and wherein the CPU scheduler and the disk scheduler allocate CPU cycles and disk IOs to the processing task and to the generating task based on their respective first weight and second weight. 10. The storage system of claim 9 , wherein the CPU scheduler and the disk scheduler vary the value of the second weight between a first value and a second value when the current resource utilization is between the first predetermined threshold and the second predetermined threshold, wherein the second predetermined threshold is greater than the first predetermined threshold. 11. The storage system of claim 10 , wherein, to maintain the value of the second weight at a constant level, the CPU scheduler and the disk scheduler is to maintain the second weight at the first value when the current resource utilization in the storage system is less than the first predetermined threshold. 12. The storage system of claim 10 , wherein, to maintain the value of the second weight at a constant level, the CPU scheduler and the disk scheduler is to maintain the second weight at the second value when the current resource utilization in the storage system is greater than the second predetermined threshold. 13. The storage system of claim 10 , wherein the value of the second weight grows linearly from the first value to the second value when the current resource utilization is between the first predetermined threshold and the second predetermined threshold. 14. The storage system of claim 10 , wherein the value of the second weight grows exponentially from the first value to the second value when the current resource utilization is between the first predetermined threshold and the second predetermined threshold. 15. The storage system of claim 10 , wherein the value of the second weight grows in a step function from the first value to the second value when the current resource utilization is between the first predetermined threshold and the second predetermined threshold. 16. A non-transitory computer-readable storage medium storing program instructions that when executed by a processor cause the processor to: assign a first weight to a processing task that increases resource utilization of a resource for processing incoming input/output (IO) requests; assign a second weight to a generating task that decreases the resource utilization of the resource; dynamically adjust the second weight based on a current resource utilization in the storage system, including: varying a value to the second weight when the current resource utilization is between a first predetermined threshold and a second predetermined threshold, and maintaining the value of the second weight at a constant level when the current resource utilization is below the first predetermined threshold or above the second predetermined threshold; and allocate central processing unit (CPU) cycles and disk IOs to the processing task and to the generating task based on their respective first weight and second weight. 17. The non-transitory computer-readable storage medium of claim 16 , wherein to dynamically adjust the value of the second weight, the program instructions are to cause the processor to: vary the value of the second weight between a first value and a second value when the current resource utilization is between the first predetermined threshold
Improving I/O performance · CPC title
Saving storage space on storage systems · CPC title
the resources being hardware resources other than CPUs, Servers and Terminals · CPC title
the resource being a machine, e.g. CPUs, Servers, Terminals · CPC title
considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration (scheduling strategies G06F9/4881 and subgroups) · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.