The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard Real-Time Environments
IEEE Transactions on Computers
Aperiodic servers in a deadline scheduling environment
Real-Time Systems
Fundamental limits and tradeoffs of providing deterministic guarantees to VBR video traffic
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
ISCA '96 Proceedings of the 23rd annual international symposium on Computer architecture
Efficient network QoS provisioning based on per node traffic shaping
IEEE/ACM Transactions on Networking (TON)
Exact admission control for networks with a bounded delay service
IEEE/ACM Transactions on Networking (TON)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Efficient Admission Control for EDF Schedulers
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Aperiodic task scheduling for real-time systems
Aperiodic task scheduling for real-time systems
Hi-index | 0.00 |
Real-time packet schedulers based on EDF policy have been extensively studied to support end-to-end bounded delay for real-time traffic. Since non-real-time traffic could hurt the schedulability of real-time traffic, we need a real-time packet scheduling method considering non-real-time traffic. In this paper, we propose a new admission control algorithm for EDF-based packet scheduling scheme. Proposed scheme consists of two packet schedulers: an EDF scheduler servicing real-time traffic and a Periodic Server (PS) scheduler servicing non-real-time traffic periodically. Proposed scheme provides good performance to non-real-time flows while guaranteeing the schedulability of real-time flows.