Allocating fixed-priority periodic tasks on multiprocessor systems
Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Real-Time Systems
Efficient performance estimation for general real-time task systems
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
A feasibility decision algorithm for rate monotonic scheduling of periodic real-time tasks
RTAS '95 Proceedings of the Real-Time Technology and Applications Symposium
A generalized utilization bound test for fixed-priority real-time scheduling
RTCSA '95 Proceedings of the 2nd International Workshop on Real-Time Computing Systems and Applications
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Improved Response-Time Analysis Calculations
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Rate Monotonic Analysis: The Hyperbolic Bound
IEEE Transactions on Computers
Measuring the Performance of Schedulability Tests
Real-Time Systems
The case for the precision timed (PRET) machine
Proceedings of the 44th annual Design Automation Conference
Uniprocessor scheduling under precedence constraints for embedded systems design
ACM Transactions on Embedded Computing Systems (TECS)
Sensitivity analysis for fixed-priority real-time systems
Real-Time Systems
Predictable programming on a precision timed architecture
CASES '08 Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems
An analysis of the AUTOSAR OS timing protection mechanism
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Revisiting fixed priority techniques
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
Constant-time admission control for deadline monotonic tasks
Proceedings of the Conference on Design, Automation and Test in Europe
Utilization bound for periodic task set with composite deadline
Computers and Electrical Engineering
Toward probabilistic real-time calculus
ACM SIGBED Review
Reliability comparison of schedulability test in ubiquitous computing
UIC'11 Proceedings of the 8th international conference on Ubiquitous intelligence and computing
Enabling parametric feasibility analysis in real-time calculus driven performance evaluation
CASES '11 Proceedings of the 14th international conference on Compilers, architectures and synthesis for embedded systems
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
High performance dynamic voltage/frequency scaling algorithm for real-time dynamic load management
Journal of Systems and Software
Mathematical formalisms for performance evaluation of networks-on-chip
ACM Computing Surveys (CSUR)
Lowest priority first based feasibility analysis of real-time systems
Journal of Parallel and Distributed Computing
Limited preemptive scheduling of non-independent task sets
Proceedings of the Eleventh ACM International Conference on Embedded Software
Hi-index | 14.98 |
Feasibility analysis of fixed priority systems has been widely studied in the real-time literature and several acceptance tests have been proposed to guarantee a set of periodic tasks. They can be divided in two main classes: polynomial time tests and exact tests. Polynomial time tests can efficiently be used for on-line guarantee of real-time applications, where tasks are activated at runtime. These tests introduce a negligible overhead, when executed upon a new task arrival, however provide only a sufficient schedulability condition, which may cause a poor processor utilization. On the other hand, exact tests, which are based on response time analysis, provide a necessary and sufficient schedulability condition, but are too complex to be executed on line for large task sets. As a consequence, for large task sets, they are often executed off line. This paper proposes a novel approach for analyzing the schedulability of periodic task sets on a single processor under an arbitrary fixed priority assignment. Using this approach, we derive a new schedulability test which can be tuned through a parameter to balance complexity versus acceptance ratio, so that it can be used on line to better exploit the processor, based on the available computational power. Extensive simulations show that our test, when used in its exact form, is significantly faster than the current response time analysis methods. Moreover the proposed approach, for its elegance and compactness, offers an explanation of some known phenomena of fixed priority scheduling and could be helpful for further work on schedulability analysis.