Stride scheduling
From Wikipedia, the free encyclopedia
Soft real-time scheduling algorithm
Some of this article's listed sources may not be reliable . Please help improve this article by looking for better, more reliable sources. Unreliable citations may be challenged and removed. (April 2023) (Learn how and when to remove this message)
Stride scheduling[1] is a type of scheduling mechanism that has been introduced as a simple concept to achieve proportional central processing unit (CPU) capacity reservation among concurrent processes. Stride scheduling aims to sequentially allocate a resource for the duration of standard time-slices (quantum) in a fashion, that performs periodic recurrences of allocations. Thus, a process p1 which has reserved twice the share of a process p2 will be allocated twice as often as p2. In particular, process p1 will even be allocated two times every time p2 is waiting for allocation, assuming that neither of the two processes performs a blocking operation.
See also
[edit ]References
[edit ]- ^ Waldspurger, Carl A. (1995). Lottery and Stride Scheduling: Flexible Proportional-Share Resource Management (PDF) (Thesis). Cambridge: MIT Laboratory for Computer Science, Massachusetts Institute of Technology.
Stub icon
This computer science article is a stub. You can help Wikipedia by expanding it.