Random number generators: good ones are hard to find
Communications of the ACM
On the competitiveness of on-line real-time task scheduling
Real-Time Systems
Linear robust control
Scheduling for Overload in Real-Time Systems
IEEE Transactions on Computers
A tool for performance estimation of networked embedded end-systems
DAC '98 Proceedings of the 35th annual Design Automation Conference
Overload Management in Real-Time Control Applications Using m,k $(m,k)$-Firm Guarantee
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Computers
Performance Guarantees for Web Server End-Systems: A Control-Theoretical Approach
IEEE Transactions on Parallel and Distributed Systems
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines
IEEE Transactions on Computers
Probabilistic performance guarantee for real-time tasks with varying computation times
RTAS '95 Proceedings of the Real-Time Technology and Applications Symposium
Skip-Over: algorithms and complexity for overloaded systems that allow skips
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
A Dynamic Quality of Service Middleware Agent for Mediating Application Resource Usage
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Stochastic Analysis of Periodic Real-Time Systems
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Memory and Time-Efficient Schedulability Analysis of Task Sets with Stochastic Execution Time
ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
Aspects of a Dynamically Adaptive Operating System
IEEE Transactions on Computers
Enhanced fixed-priority scheduling with (m,k)-firm guarantee
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Adaptive Resource Allocation Control for Fair QoS Management
IEEE Transactions on Computers
| Hi-index | 0.00 |
Many real-time systems have firm real-time requirementswhich allow occasional deadline violations but discard anytasks that are not finished by their deadlines. To measurethe goodness of such a system, a quality of service (QoS)metric is needed. Examples of often used QoS metrics forfirm real-time systems are average deadline miss rates and(m, k)-firm constraint. However, for certain applications,these metrics may not be adequate measures of system performance.This paper introduces a novel QoS constraint fornetworked feedback control systems. We show that this constraintcan be directly related to the control system's performance.We then present three different scheduling approacheswith respect to this QoS constraint. Experimentalresults are provided to compare these approaches.