Fair Real-Time Resource Allocation for Internet End System’s QoS Support

Abstract

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 twofold. 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.

The work reported in this paper was supported in part by MOST under the National Research Laboratory (NRL) grant 2000-N-NL-01-C-136, by Korea Institute of Industrial Technology Evaluation and Planning (ITEP) under grant 00014744, by Automatic Control Research Center (ACRC), and by the Automation and Systems Research Institute (ASRI).