Stack-based scheduling for realtime processes
Real-Time Systems
Feasibility problems for recurring tasks on one processor
MFCS '90 Selected papers of the 15th international symposium on Mathematical foundations of computer science
Improvement in feasibility testing for real-time tasks
Real-Time Systems
EMERALDS: a small-memory real-time microkernel
Proceedings of the seventeenth ACM symposium on Operating systems principles
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Combining (/sub m//sup n/)-hard deadlines and dual priority scheduling
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Response Time Analysis for Tasks Scheduled under EDF within Fixed Priorities
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Rate monotonic vs. EDF: judgment day
Real-Time Systems
Sustainable Scheduling Analysis
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Analysis of Hierarchical EDF Pre-emptive Scheduling
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Concurrent and Real-Time Programming in Ada
Concurrent and Real-Time Programming in Ada
Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems
IEEE Transactions on Computers
Hybrid-priority Scheduling of Resource-Sharing Sporadic Task Systems
RTAS '08 Proceedings of the 2008 IEEE Real-Time and Embedded Technology and Applications Symposium
Schedulability Analysis for Real-Time Systems with EDF Scheduling
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
Hi-index | 0.00 |
Earliest Deadline First (EDF) and Fixed Priority (FP) scheduling represent the two main dispatching policies within the research domain of real-time systems engineering. Both dispatching policies are now supported by Ada. In this paper the two approaches are combined to maximize the advantages of both schemes. From EDF comes efficiency, from FP predictability. A system model is presented in which a relatively small number of high-integrity tasks are scheduled by FP, with the rest of the tasks being handled via an EDF domain of lower priority. Two aspects of integration are covered in this paper. Firstly, Response-Time Analysis (for FP) and Processor-Demand Analysis (for EDF) are brought together to provide a single analysis framework. Secondly, the programming of systems which combine FP and EDF is addressed within the facilities provided by Ada 2005. Both partitioned and dynamic schemes are covered.