Loading...
Please wait, while we are loading the content...
Similar Documents
An efficient on-line job admission control scheme to guarantee deadlines for qos-demanding applications.
| Content Provider | CiteSeerX |
|---|---|
| Author | Hong, Seongsoo Ryu, Minsoo Park, Jungkeun |
| Abstract | Guaranteeing deadlines is essential in providing high levels of QoS (Quality of Service) in many networked applications that require timely processing and delivery of requested data. However, despite recent developments in real-time computing, current real-time scheduling theory cannot be directly applied to those applications since most real-time research has focused on the periodic task model while recent networked applications have the distinguishing characteristic that processor usage patterns include both periodic and aperiodic tasks. In this paper, we present a novel admission control scheme for a mixed set of periodic and aperiodic tasks with hard deadlines under EDF, which can achieve near optimal performance with practical utility. The proposed admission control scheme is based on a novel schedulability measure for a deadlineconstrained task, called utilization demand, which can be viewed as a combination of the processor time demand and the utilization factor. We first show that this new schedulability measure provides a necessary and sufficient schedulability condition for aperiodic tasks. We then present an efficient schedulability test for a mixed set of periodic and aperiodic tasks under EDF. The resulting schedulability test can be implemented as an on-line admission control algorithm of O(n) complexity, which in practice incurs sufficiently low overhead. Our experimental results show that the proposed admission control scheme outperforms existing approaches with respect to achievable processor utilization. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Optimal Performance Low Overhead Qos-demanding Application Resulting Schedulability Test Real-time Computing Practice Incurs Utilization Demand Processor Usage Pattern High Level Periodic Task Model Timely Processing Efficient Schedulability Test Sufficient Schedulability Condition Current Real-time Scheduling Theory Cannot Admission Control Scheme Novel Schedulability Measure Proposed Admission Control Scheme Processor Time Demand Many Networked Application Recent Development Novel Admission Control Scheme Aperiodic Task Hard Deadline Practical Utility Guarantee Deadline Utilization Factor Achievable Processor Utilization Recent Networked Application Experimental Result Mixed Set On-line Admission Control Algorithm Real-time Research New Schedulability Measure Deadlineconstrained Task |
| Content Type | Text |
