Stride scheduling 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 <var>p1</var> which has reserved twice the share of a process <var>p2</var> will be allocated twice as often as <var>p2</var>. In particular, process <var>p1</var> will even be allocated two times every time <var>p2</var> is waiting for allocation, assuming that neither of the two processes performs a blocking operation.