Some Results of the Earliest Deadline Scheduling Algorithm
IEEE Transactions on Software Engineering
Dynamic Scheduling of Hard Real-Time Tasks and Real-Time Threads
IEEE Transactions on Software Engineering
An extendible approach for analyzing fixed priority hard real-time tasks
Real-Time Systems
Allocating fixed-priority periodic tasks on multiprocessor systems
Real-Time Systems
Incremental Reconfiguration and Load Adjustment in Adaptive Real-Time Systems
IEEE Transactions on Computers
A Multiframe Model for Real-Time Tasks
IEEE Transactions on Software Engineering
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Real-Time Systems
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems
IEEE Transactions on Computers
Efficient On-Line Schedulability Tests for Priority Driven Real-Time Systems
RTAS '00 Proceedings of the Sixth IEEE Real Time Technology and Applications Symposium (RTAS 2000)
A multiframe model for real-time tasks
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
An Efficient RMS Admission Control and its Application to Multiprocessor Scheduling
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Measuring the Performance of Schedulability Tests
Real-Time Systems
Optimal task execution times for periodic tasks using nonlinear constrained optimization
The Journal of Supercomputing
Sharp utilization thresholds for some realtime scheduling problems
ACM SIGMETRICS Performance Evaluation Review
| Hi-index | 14.99 |
Abstract--In many practical real-time applications, there is a given set of task frequencies (i.e., inverse of task periods) corresponding to predetermined QoS options that the applications can choose. For example, in audio applications, the typical choices of playback frequencies are for CD quality, radio quality, and phone quality. Similar configurations can be found in streaming video and in control applications. In such systems, applications dynamically arrive requesting one of the periods provided by the QoS manager. Thus, the accurate and efficient online schedulability test is essential for any task set whose periods are chosen from the QoS period set. For this purpose, this paper proposes new utilization bounds as a function of given QoS periods. As long as there is a set of given periods that can be chosen by applications, the bounds developed in this paper can be used by the QoS manager to quickly determine the schedulability of dynamic applications.