Abstract
A proportional share resource allocation algorithm is proposed for the real-time performance of time-shared operating systems. The resource is allocated in discrete-sized time quanta such that each process progresses at a precise, uniform rate. The algorithm is analyzed in the context of an idealized system in which a resource is assumed to be granted in arbitrarily small intervals of time. The algorithm guarantees that the difference between the service time that a process should receive in the idealized system and the service time it actually receives in the real system is optimally bounded by the size of the time quantum. The algorithm provides support for dynamic operations, and for both fractional and non-uniform time quanta.
| Original language | English |
|---|---|
| Pages | 288-299 |
| Number of pages | 12 |
| State | Published - 1996 |
| Event | Proceedings of the 1996 17th IEEE Real-Time Systems Symposium - Washington, DC, USA Duration: Dec 4 1996 → Dec 6 1996 |
Conference
| Conference | Proceedings of the 1996 17th IEEE Real-Time Systems Symposium |
|---|---|
| City | Washington, DC, USA |
| Period | 12/4/96 → 12/6/96 |