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)
Real-Time Systems
Real-Time Systems and Programming Languages: ADA 95, Real-Time Java, and Real-Time POSIX
Real-Time Systems and Programming Languages: ADA 95, Real-Time Java, and Real-Time POSIX
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
A Hyperbolic Bound for the Rate Monotonic Algorithm
ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
Real-Time System Design and Analysis
Real-Time System Design and Analysis
Feedback EDF Scheduling Exploiting Dynamic Voltage Scaling
RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
Schedulability Analysis of Periodic Fixed Priority Systems
IEEE Transactions on Computers
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
A non-preemptive scheduling algorithm for soft real-time systems
Computers and Electrical Engineering
Optimal Static Task Scheduling on Reconfigurable Hardware Devices Using Model-Checking
RTAS '07 Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium
Rate monotonic schedulability tests using period-dependent conditions
Real-Time Systems
Guest editorial: Recent advances in wireless networks and systems
Computers and Electrical Engineering
Revisiting fixed priority techniques
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
Power efficient rate monotonic scheduling for multi-core systems
Journal of Parallel and Distributed Computing
A comparative study of rate monotonic schedulability tests
The Journal of Supercomputing
Optimal task execution times for periodic tasks using nonlinear constrained optimization
The Journal of Supercomputing
Lowest priority first based feasibility analysis of real-time systems
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Due to polynomial time complexity, utilization based tests are desired for online feasibility analysis of periodic task systems. However, the associated disadvantage with these tests is that they propose a bound on system utilization, which trade processor utilization for performance. On the contrary, response time based tests share pseudo-polynomial time complexity, which are very expensive in terms of analysis time and therefore, impractical for analyzing feasibility of online systems. Realizing the advantage of utilization based tests over response time tests, attempts are being made to propose utilization based exact tests that achieve 100% CPU utilization for the system by modifying task parameters such as restricting task periods to be harmonic. We show that in systems where task deadlines are large, better results are obtained by making the task deadlines harmonic. The paper proposes a novel solution to feasibility problem of periodic task system under the assumption of composite deadline by providing a utilization based exact test with an upper bound of 1 and complexity O(n).