Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Deadline-based scheduling of periodic task systems on multiprocessors
Information Processing Letters
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors
Real-Time Systems
Multiprocessor EDF and Deadline Monotonic Schedulability Analysis
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
IEEE Transactions on Computers
An Analysis of EDF Schedulability on a Multiprocessor
IEEE Transactions on Parallel and Distributed Systems
Improved Schedulability Analysis of EDF on Multiprocessor Platforms
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Algorithms for Determining the Demand-Based Load of a Sporadic Task System
RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
The partitioned dynamic-priority scheduling of sporadic task systems
Real-Time Systems
Techniques for Multiprocessor Global Schedulability Analysis
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Schedulability analysis of global EDF
Real-Time Systems
Global EDF Schedulability Analysis of Arbitrary Sporadic Task Systems
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
Global deadline-monotonic scheduling of arbitrary-deadline sporadic task systems
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Global fixed-priority scheduling of arbitrary-deadline sporadic task systems
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Tests for global EDF schedulability analysis
Journal of Systems Architecture: the EUROMICRO Journal
Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling
Journal of Systems Architecture: the EUROMICRO Journal
A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
Response time bounds for G-EDF without intra-task precedence constraints
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
FPSL, FPCL and FPZL schedulability analysis
Real-Time Systems
| Hi-index | 0.00 |
Recent results on the global multiprocessor edf scheduling of sporadic task systems are, for the most part, applicable only to task systems in which each task's relative deadline parameter is constrained to be no larger than its minimum inter-arrival separation. This paper introduces new analysis techniques that allow for similar results to be derived for task systems in which individual tasks are not constrained in this manner. For tasks with deadlines greater than their minimum inter-arrival separation, two models are considered, with and without an implicit intra-task job precedence constraint. The new analyses yield schedulability conditions that strictly dominate some previously proposed tests that are generally accepted to represent the current state of the art in multiprocessor edf schedulability analysis, and permits the derivation of an improved speed-up bound.