Stride Scheduling: Deterministic Proportional- Share Resource Management

Waldspurger, Carl A.; Weihl, William E.

Stride Scheduling: Deterministic Proportional- Share Resource Management

Download

Name

MIT-LCS-TM-528.pdf

Size

771.08 KB

Format

Adobe PDF

Checksum (MD5)

076b284e4e1c9e1b60b81b1fd7c079f3

Author(s)

Waldspurger, Carl A.

•

Weihl, William E.

Date Issued

June 1995

Series/Report no.

MIT-LCS-TM-528

Abstract

This paper presents stride scheduling, a deterministic scheduling technique that efficiently supports the same flexible resource management abstractions introduced by lottery scheduling. Compared to lottery scheduling, stride scheduling archives significantly improved accuracy over relative throughput rates, with significantly lower response time variability.

Persistent DSpace Link

https://hdl.handle.net/1721.1/149244