Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Stride scheduling
open-in-new
<h2 id="see-also">See also</h2> <ul><li><a href="/facts/Computer_multitasking/Q4acPNMv">Computer multitasking</a></li> <li><a href="/facts/Concurrency_control/JWnmhVd5">Concurrency control</a></li> <li><a href="/facts/Concurrent_computing/yVzQBPr9">Concurrent computing</a></li> <li><a href="/facts/Resource_contention/eAh3Rtrs">Resource contention</a></li> <li><a href="/facts/Time_complexity/77T62gmf">Time complexity</a></li> <li><a href="/facts/Thread_(computing)/hh8WHyPd">Thread (computing)</a></li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>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. <a href="http://www.waldspurger.org/carl/papers/phd-mit-tr667.pdf" target="_blank">http://www.waldspurger.org/carl/papers/phd-mit-tr667.pdf</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> </ol>