Device, system, and method for multi-resource scheduling

• US 20090125909A1
• Filed: 11/13/2007
• Published: 05/14/2009
• Est. Priority Date: 11/13/2007
• Status: Active Grant

• Current Assignee: Intel Corporation
• Original Assignee: Intel Corporation
• Inventors: Li, Tong, Hahn, Scott
• Granted Patent: US 8,959,328 B2
• Time in Patent Office: Days
• US Class Current: 718/103
• CPC Class Codes: G06F 9/5038 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

Abstract

A method, apparatus and system for selecting a highest prioritized task for executing a resource from one of a first and second expired scheduling arrays, where the first and second expired scheduling arrays may prioritize tasks for using the resource, and where tasks in the first expired scheduling array may be prioritized according to a proportionality mechanism and tasks in the second expired scheduling array may be prioritized according to an importance factor determined, for example, based on user input, and executing the task. Other embodiments are described and claimed.

Claims

1. A method comprising:

selecting a highest prioritized task, from one of a first and second expired scheduling arrays, for using a resource, wherein the first and second expired scheduling arrays prioritize tasks for using the resource, and wherein tasks in the first expired scheduling array are prioritized according to a proportionality mechanism and tasks in the second expired scheduling array are prioritized according to an importance factor determined based on user input; and

executing the task.

2. The method of claim 1, wherein the first and second expired scheduling arrays include a time slice expired array and a round expired array, respectively.

3. The method of claim 1, wherein the proportionality mechanism is a time slice mechanism.

4. The method of claim 1, wherein the proportionality mechanism is based on the quality of service requirements of the task.

5. The method of claim 1, wherein the importance factor is customized according to the system needs.

6. The method of claim 1, wherein the importance factor is based on a weight of the tasks and a system default constant.

7. The method of claim 1, further comprising periodically interrupting the allocation of resources for selecting a highest prioritized task.

8. The method of claim 1, further comprising selecting a task having a round number approximately equal to the maximum value of the round numbers associated with the tasks in the second expired array.

9. An apparatus comprising:

a memory to store tasks for using a resource in one of a first and second expired scheduling arrays according to a first and a second scheduling mechanisms, respectively, wherein tasks in the first expired scheduling array are prioritized according to a proportionality mechanism and tasks in the second expired scheduling array are prioritized according to an importance factor determined based on user input; and

a processor to execute a highest prioritized task selected from one of the first and second expired scheduling arrays.

10. The apparatus of claim 9, wherein the first and second expired scheduling arrays include a time slice expired array and a round expired array, respectively.

11. The apparatus of claim 9, wherein the proportionality mechanism is a time slice mechanism.

12. The apparatus of claim 9, wherein the proportionality mechanism is based on the quality of service requirements of the task.

13. The apparatus of claim 9, wherein the importance factor is customized according to needs of the apparatus.

14. The apparatus of claim 9, wherein the importance factor is based on a weight of the tasks and a system default constant.

15. The apparatus of claim 9, wherein the processor periodically interrupts the allocation of resources for executing the resource for the highest prioritized task.