Show simple item record

dc.contributor.authorWaldspurger, Carl A.en_US
dc.contributor.authorWeihl, William E.en_US
dc.date.accessioned2023-03-29T14:39:00Z
dc.date.available2023-03-29T14:39:00Z
dc.date.issued1995-06
dc.identifier.urihttps://hdl.handle.net/1721.1/149244
dc.description.abstractThis 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.en_US
dc.relation.ispartofseriesMIT-LCS-TM-528
dc.titleStride Scheduling: Deterministic Proportional- Share Resource Managementen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record