Stride scheduling

{{Short description|Soft real-time scheduling algorithm}}

{{Unreliable sources|date=April 2023}}

Stride scheduling{{cite thesis |first=Carl A. |last=Waldspurger |title=Lottery and Stride Scheduling: Flexible Proportional-Share Resource Management |publisher=MIT Laboratory for Computer Science, Massachusetts Institute of Technology |location=Cambridge |url=http://www.waldspurger.org/carl/papers/phd-mit-tr667.pdf |year=1995 }} 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.