Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
Journal of Computer and System Sciences
An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Tardiness Bounds under Global EDF Scheduling on a Multiprocessor
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Real-Time Scheduling on Multicore Platforms
RTAS '06 Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium
Performance of multithreaded chip multiprocessors and implications for operating system design
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
A Hybrid Real-Time Scheduling Approach for Large-Scale Multicore Platforms
ECRTS '07 Proceedings of the 19th Euromicro Conference on Real-Time Systems
Real-Time Scheduling with Task Splitting on Multiprocessors
RTCSA '07 Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Schedulability issues for EDZL scheduling on real-time multiprocessor systems
Information Processing Letters
Hierarchical Scheduling Framework for Virtual Clustering of Multiprocessors
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
Sporadic Multiprocessor Scheduling with Few Preemptions
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
On the Scalability of Real-Time Scheduling Algorithms on Multicore Platforms: A Case Study
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Scheduling Arbitrary-Deadline Sporadic Task Systems on Multiprocessors
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Notional Processors: An Approach for Multiprocessor Scheduling
RTAS '09 Proceedings of the 2009 15th IEEE Symposium on Real-Time and Embedded Technology and Applications
Semi-partitioned Fixed-Priority Scheduling on Multiprocessors
RTAS '09 Proceedings of the 2009 15th IEEE Symposium on Real-Time and Embedded Technology and Applications
Semi-partitioned Scheduling of Sporadic Task Systems on Multiprocessors
ECRTS '09 Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems
Preemption-Light Multiprocessor Scheduling of Sporadic Tasks with High Utilisation Bound
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Using NPS-F for mixed-criticality multicore systems
ACM SIGBED Review - Special Issue on the Work-in-Progress (WiP) session of the 33rd IEEE Real-Time Systems Symposium (RTSS'12)
| Hi-index | 0.00 |
Known algorithms capable of scheduling implicit-deadline sporadic tasks over identical processors at up to 100% utilisation invariably involve numerous preemptions and migrations. To the challenge of devising a scheduling scheme with as few preemptions and migrations as possible, for a given guaranteed utilisation bound, we respond with the algorithm NPS-F. It is configurable with a parameter, trading off guaranteed schedulable utilisation (up to 100%) vs preemptions. For any possible configuration, NPS-F introduces fewer preemptions than any other known algorithm matching its utilisation bound.A clustered variant of the algorithm, for systems made of multicore chips, eliminates (costly) off-chip task migrations, by dividing processors into disjoint clusters, formed by cores on the same chip (with the cluster size being a parameter). Clusters are independently scheduled (each, using non-clustered NPS-F). The utilisation bound is only moderately affected.We also formulate an important extension (applicable to both clustered and non-clustered NPS-F) which optimises the supply of processing time to executing tasks and makes it more granular. This reduces processing capacity requirements for schedulability without increasing preemptions.