Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors
Real-Time Systems
Static-Priority Scheduling on Multiprocessors
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Multiprocessor EDF and Deadline Monotonic Schedulability Analysis
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Improved Schedulability Analysis of EDF on Multiprocessor Platforms
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Non-Preemptive Robustness under Reduced System Load
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
The Non-preemptive Scheduling of Periodic Tasks upon Multiprocessors
Real-Time Systems
Sustainable Scheduling Analysis
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
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
New Schedulability Test Conditions for Non-preemptive Scheduling on Multiprocessor Platforms
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
A Unified Hard/Soft Real-Time Schedulability Test for Global EDF Multiprocessor Scheduling
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms
IEEE Transactions on Parallel and Distributed Systems
Sustainable Multiprocessor Scheduling of Sporadic Task Systems
ECRTS '09 Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems
New Response Time Bounds for Fixed Priority Multiprocessor Scheduling
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Journal of Computer and System Sciences
SEUS'07 Proceedings of the 5th IFIP WG 10.2 international conference on Software technologies for embedded and ubiquitous systems
Brute-force determination of multiprocessor schedulability for sets of sporadic hard-deadline tasks
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Schedulability analysis of non-preemptive recurring real-time tasks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A fair assignment algorithm for multiple preference queries
Proceedings of the VLDB Endowment
Limited carry-in technique for real-time multi-core scheduling
Journal of Systems Architecture: the EUROMICRO Journal
Hi-index | 0.00 |
Non-preemptive scheduling is usually considered inferior to preemptive scheduling for time critical systems, because the non-preemptive block would lead to poor task responsiveness. Although this is true in single-processor scheduling, we found by empirical simulation experiments that it is not necessarily the case in multiprocessor scheduling. Additionally, non-preemptive scheduling enjoys other benefits like lower implementation complexity and run-time overhead. So non-preemptive scheduling may be a better alternative compared to preemptive scheduling for a considerable part of real-time applications on multiprocessor/multi-core platforms. As the technical contribution, we study the schedulability analysis problem of global non-preemptive fixed-priority scheduling (NP-FP) on multiprocessors. We propose schedulability test conditions for NP-FP, building upon the ''problem window analysis'' by Baruah [8] for preemptive scheduling. We firstly derive a linear-time general schedulability test condition that works on not only NP-FP, but also any other work-conserving non-preemptive scheduling algorithm. Then we improve the analysis and present a test condition of quadratic time-complexity for NP-FP, which has significant performance improvement comparing to the first one. A notable advantage of our proposed test conditions is, while the test in [8] needs to enumerate for a large number of possible problem window sizes, our proposed test conditions only need to be conducted with a single problem window size, and thereby are significantly more efficient. Experiments with randomly generated task sets are conducted to evaluate the performance of the proposed test conditions.