A Proportional Share Resource Allocation Algorithm for Real-Time, Time-Shared Systems (1996) [165 citations — 15 self]
http://www.cs.berkeley.edu/~istoica/tr.ps.gz
http://www.cs.cmu.edu/~istoica/tr.ps.gz
http://www.cs.utexas.edu/users/plaxton/html/../ps/
http://www.cs.unc.edu/~jeffay/papers/RTSS-96a.pdf
ftp://ftp.cs.unc.edu/pub/users/jeffay/papers/RTSS-
ftp://ftp.cs.unc.edu/pub/users/jeffay/papers/RTSS-
DBLP
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Ion Stoica and Hussein Abdel-wahab and Kevin Jeffay and Sanjoy K. Baruah and Johannes E. Gehrke and C. Greg Plaxton},
title = {A Proportional Share Resource Allocation Algorithm for Real-Time, Time-Shared Systems},
booktitle = {In Proceedings of the 17th IEEE Real-Time Systems Symposium},
year = {1996},
pages = {288--299}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
We propose and analyze a proportional share resource allocation algorithm for realizing real-time performance in time-shared operating systems. Processes are assigned a weight which determines a share (percentage) of the resource they are to receive. The resource is then allocated in discrete-sized time quanta in such a manner that each process makes progress at a precise, uniform rate. Proportional share allocation algorithms are of interest because (1) they provide a natural means of seamlessly integrating real- and nonreal -time processing, (2) they are easy to implement, (3) they provide a simple and effective means of precisely controlling the real-time performance of a process, and (4) they provide a natural mean of policing so that processes that use more of a resource than they request have no ill-effect on well-behaved processes. We analyze our algorithm in the context of an idealized system in which a resource is assumed to be granted in arbitrarily small intervals of time an...
