Stride scheduling
Soft real-time scheduling algorithm
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
- Computer multitasking
- Concurrency control
- Concurrent computing
- Resource contention
- Time complexity
- Thread (computing)
References
- ^ 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.
- v
- t
- e
Processor scheduling
- Deadline-monotonic
- Earliest deadline
- Earliest eligible virtual deadline first
- Fair-share
- Fixed-priority pre-emptive
- Foreground-background
- Gang
- Generalized foreground-background
- Highest response ratio next
- Lottery
- Multilevel feedback queue
- Process Contention Scope
- Proportional share
- Rate-monotonic
- Round-robin
- Shortest job next
- Shortest remaining time
- Statistical time-division multiplexing
- Stride
- Two-level
- Windows NT
- YDS algorithm
- Processor affinity
- Starvation
 | This computer science article is a stub. You can help Wikipedia by expanding it. |
- v
- t
- e
