Stochastic priority-based task scheduler
First Claim
Patent Images
1. In a computer system wherein a plurality of executable tasks are available for execution, a task selection method comprising the steps of:
- maintaining a data structure containing the plurality of executable tasks;
associating a priority with each of the executable tasks; and
selecting a task at random weighted by a task priority from the data structure of executable tasks.
2 Assignments
0 Petitions
Accused Products
Abstract
A stochastic priority based scheduler for selecting executable tasks in a computer system is disclosed. The stochastic priority based scheduler selects tasks on the basis of a random number weighted by task priority. Since every task has a nonzero finite probability of being selected, the probability being proportional to the task priority, all tasks, even low priority ones, have a chance of being selected, thus eliminating the lockout problem.
118 Citations
7 Claims
-
1. In a computer system wherein a plurality of executable tasks are available for execution, a task selection method comprising the steps of:
-
maintaining a data structure containing the plurality of executable tasks; associating a priority with each of the executable tasks; and selecting a task at random weighted by a task priority from the data structure of executable tasks. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
Specification