Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Real-Time Systems
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking - Network processors
Approximate Schedulability Analysis
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
The Space of Rate Monotonic Schedulability
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
An Event Stream Driven Approximation for the Analysis of Real-Time Systems
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
Biasing Effects in Schedulability Measures
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
A New Sufficient Feasibility Test for Asynchronous Real-Time Periodic Task Sets
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
Battery discharge aware energy feasibility analysis
CODES+ISSS '06 Proceedings of the 4th international conference on Hardware/software codesign and system synthesis
CODES+ISSS '07 Proceedings of the 5th IEEE/ACM international conference on Hardware/software codesign and system synthesis
Probabilistic performance risk analysis at system-level
CODES+ISSS '07 Proceedings of the 5th IEEE/ACM international conference on Hardware/software codesign and system synthesis
Improvements in polynomial-time feasibility testing for EDF
Proceedings of the conference on Design, automation and test in Europe
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
EDF-schedulability of synchronous periodic task systems is coNP-hard
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the Conference on Design, Automation and Test in Europe
White box performance analysis considering static non-preemptive software scheduling
Proceedings of the Conference on Design, Automation and Test in Europe
Managing latency in embedded streaming applications under hard-real-time scheduling
Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Fast calculation of permissible slowdown factors for hard real-time systems
PATMOS'07 Proceedings of the 17th international conference on Integrated Circuit and System Design: power and timing modeling, optimization and simulation
Approximation scheme for real-time tasks under fixed-priority scheduling with deferred preemption
Proceedings of the 21st International conference on Real-Time Networks and Systems
| Hi-index | 0.01 |
This paper presents new fast exact feasibility tests for uniprocessor real-time systems using preemptive EDF scheduling.Task sets which are accepted by previously described sufficient tests will be evaluated in nearly the same time as with the old tests by the new algorithms. Many task sets are not accepted by the earlier tests despite them beeing feasible.These task sets will be evaluated by the new algorithms a lot faster than with known exact feasibility tests.Therefore it is possible to use them for many applications for which only sufficient test are suitable.Additionally this paper shows that the best previous known sufficient test, the best known feasibility bound and the best known approximation algorithm can be derived from these new tests.In result this leads to an integrated schedulability theory for EDF.