Improvement in feasibility testing for real-time tasks
Real-Time Systems
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Effective Analysis for Engineering Real-Time Fixed Priority Schedulers
IEEE Transactions on Software Engineering
Analysis of Hierar hical Fixed-Priority Scheduling
ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications (Real-Time Systems Series)
Hierarchical Fixed Priority Pre-Emptive Scheduling
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Sustainable Scheduling Analysis
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Resource Sharing in Hierarchical Fixed Priority Pre-Emptive Systems
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Resource Sharing in EDF-Scheduled Systems: A Closer Look
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Optimal (D- J)-monotonic priority assignment
Information Processing Letters
Analysis of Hierarchical EDF Pre-emptive Scheduling
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Improvement to Quick Processor-Demand Analysis for EDF-Scheduled Real-Time Systems
ECRTS '09 Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems
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
A review of fixed priority and EDF scheduling for hard real-time uniprocessor systems
ACM SIGBED Review - Special Issue on the 3rd Embedded Operating System Workshop (EWiLi 2013)
| Hi-index | 0.00 |
Earliest Deadline First (EDF) is the most widely studied optimal dynamic scheduling algorithm for uniprocessor real-time systems. In the existing literature, however, there is no complete exact analysis for EDF scheduling when both resource sharing and release jitter are considered. Since resource sharing and release jitter are important characteristics of embedded real-time systems, a solid theoretical foundation should be provided for EDF scheduled systems. In this paper, we extend traditional processor demand analysis to let arbitrary deadline real-time tasks share non-preemptable resources and suffer release jitter. A complete and exact schedulability analysis for EDF scheduled systems is provided. This analysis is incorporated into QPA (Quick Processor-demand Analysis) which provides an efficient implementation of the exact test.