Interprocess Resource-Based Dynamic Scheduling System and Method
AssigneeAlcatel Lucent
InventorsSubash Bohra, Scott Nam
Life of this patent
Estimating the term…
Abstract
A method and system for scheduling tasks in a processing system. In one embodiment, the method comprises processing tasks from a primary work queue, wherein the tasks consume resources that are operable to be released. Whenever the volume of resources that have been consumed exceeds a threshold, the processor executes tasks from a secondary work queue for a period of time. The secondary work queue is comprised of tasks from the primary work queue that can release the resources; the secondary work queue can be sorted according to the volume of resources that can be released.
Claims20
A method of scheduling tasks in a computer system, comprising:
- processing a plurality of tasks from a primary work queue, wherein said plurality of tasks consume interprocess communication resources operable to be released;
- and
- whenever a volume of consumed interprocess communication resources exceeds a threshold, processing tasks from a secondary work queue for a given time period, wherein said secondary work queue comprises tasks from said primary work queue that can release the greatest volume of interprocess communication resources.
A method for scheduling tasks in a processor, the method comprising:
- during execution of tasks from a primary work queue, maintaining a list of resources pending for each task in said primary work queue;
- determining, after a first time period, whether a threshold of resources pending has been exceeded;
- and
- if said threshold has been exceeded, populating a secondary work queue with tasks having resources pending, said secondary work queue being sorted according to a given factor, and executing tasks from said secondary work queue for a second time period before returning to the execution of tasks from said primary work queue.
A system, comprising:
- means for populating a first work queue with a plurality of tasks;
- means for monitoring resources pending for each of said plurality of tasks;
- means for populating a second work queue with tasks identified by said means for monitoring, wherein said second work queue is ordered according to a given factor;
- and
- means for alternating processing of tasks from said first work queue and said second work queue based at least in part upon determining that said resources pending have exceeded a threshold.
Dependencies are inferred from the claim text.