IEEE/ACM Transactions on Networking (TON)
A proportional share resource allocation algorithm for real-time, time-shared systems
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Lottery scheduling: flexible proportional-share resource management
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
CPU Service Classes for Multimedia Applications
ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
| Hi-index | 0.00 |
We present a resource allocation framework that can handle both the bandwidth and deadline requirements in allocating time shared resources at an Internet end system. The proposed framework has a two-level hierarchy. At the top-level, a proportional share scheduler, called Earliest Finish Time Credit/Debit (EFT-C/D) scheduler, allocates a time shared resource like CPU to the bottom-level schedulers in proportion to the specified rate of each bottom-level scheduler. The bottom-level schedulers each employ different scheduling disciplines to handle different timing requirements. Our major contributions are two-fold. First, we present the EFT-C/D algorithm that can achieve nearly perfect fairness when compared to the ideal GPS server. Second, we present a utilization-based schedulability analysis for the EDF scheduler at the bottom-level. Our analysis technique enables on-line admission control by allowing us to easily test the schedulability of a given task set by simply computing required resource utilization.