Stride scheduling

<p>Stride scheduling is a type of <a href="/facts/Scheduling_(computing)/XptmcM1a">scheduling</a> mechanism that has been introduced as a simple concept to achieve <a href="/facts/Proportional_share_scheduling/w4YwJ8kH">proportional</a> <a href="/facts/Central_processing_unit/Jxp1bqMV">central processing unit</a> (CPU) capacity reservation among <a href="/facts/Concurrency_(computer_science)/Ctnrrq4A">concurrent</a> <a href="/facts/Process_(computing)/Vcq7EnUV">processes</a>. Stride scheduling aims to sequentially allocate a <a href="/facts/System_resource/bX958SEx">resource</a> 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 <a href="/facts/Blocking_(computing)/6vvBpp7A">blocking operation</a>.
</p>

Stride scheduling open-in-new

Stride scheduling