An extendible approach for analyzing fixed priority hard real-time tasks
Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
On priority asignment in fixed priority scheduling
Information Processing Letters
Real-Time Systems
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems
IEEE Transactions on Computers
A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Improved Response-Time Analysis Calculations
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
The Space of Rate Monotonic Schedulability
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
A Hyperbolic Bound for the Rate Monotonic Algorithm
ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
Preemptive scheduling in overloaded systems
Journal of Computer and System Sciences
Real-Time System Design and Analysis
Real-Time System Design and Analysis
Schedulability Analysis of Periodic Fixed Priority Systems
IEEE Transactions on Computers
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Efficient Exact Test for Rate-Monotonic Schedulability Using Large Period-Dependent Initial Values
IEEE Transactions on Computers
Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems
IEEE Transactions on Computers
Real-Time Systems and Programming Languages: Ada, Real-Time Java and C/Real-Time POSIX
Real-Time Systems and Programming Languages: Ada, Real-Time Java and C/Real-Time POSIX
Machine scheduling with job class setup and delivery considerations
Computers and Operations Research
Revisiting fixed priority techniques
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
Utilization bound for periodic task set with composite deadline
Computers and Electrical Engineering
Power efficient rate monotonic scheduling for multi-core systems
Journal of Parallel and Distributed Computing
Optimal task execution times for periodic tasks using nonlinear constrained optimization
The Journal of Supercomputing
| Hi-index | 0.00 |
The feasibility problem of periodic tasks under fixed priority systems has always been a critical research issue in real-time systems and a number of feasibility tests have been proposed to guarantee the timing requirements of real-time systems. These tests can be broadly classified into: (a) inexact and (b) exact tests. The inexact tests are applied to the task sets that present lower utilization, while the exact tests become inevitable when system utilization is high. The exact tests can be further classified into: (a) Scheduling Points Tests (SPT) and (b) Response Time Tests (RTT). The SPT analyze task set feasibility at the arrival times while the RTT utilize fixed-point techniques to determine task feasibility. All of the available exact feasibility tests, whichever class it belongs to, share pseudo-polynomial complexity. Therefore, the aforementioned tests become impractical for online systems. Currently, both SPT and RTT employ the Highest Priority First (HPF) approach, which determines the system feasibility by testing the schedulability of individual tasks in the decreasing order of priority. In contrast, this work exploits the Lowest Priority First (LPF) alternative which is an aggressive solution based on the observation that the system infeasibility is primarily due to the lower priority tasks and not because of the higher priority tasks. For the average case analysis, our technique demonstrates promising results. Moreover, in the worst case scenario our solution is no inferior to the existing state of the art alternatives. We compare our proposed technique with the existing tests: (a) by counting the number of scheduling points used by a test that belongs to the SPT, (b) by counting the number of inner-most loops executed by an algorithm for the RTT, and (c) by measuring the actual running time of the existing alternatives.