Global EDF-based scheduling with laxity-driven priority promotion
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)
A real-time framework for multiprocessor platforms using Ada 2012
Ada-Europe'11 Proceedings of the 16th Ada-Europe international conference on Reliable software technologies
Implementing multicore real-time scheduling algorithms based on task splitting using ada 2012
Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
A semi-partitioned real-time scheduling approach for periodic task systems on multicore platforms
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Towards network-on-chip agreement protocols
Proceedings of the tenth ACM international conference on Embedded software
Proceedings of the 20th International Conference on Real-Time and Network Systems
A semi-partitioned approach for parallel real-time scheduling
Proceedings of the 20th International Conference on Real-Time and Network Systems
Deferred setting of scheduling attributes in Ada 2012
ACM SIGAda Ada Letters
Adding multiprocessor and mode change support to the Ada real-time framework
ACM SIGAda Ada Letters
Contention-free executions for real-time multiprocessor scheduling
ACM Transactions on Embedded Computing Systems (TECS) - Special Section ESFH'12, ESTIMedia'11 and Regular Papers
Are virtual channels the bottleneck of priority-aware wormhole-switched NoC-based many-cores?
Proceedings of the 21st International conference on Real-Time Networks and Systems
Deferred and atomic setting of scheduling attributes for ada
ACM SIGAda Ada Letters
| Hi-index | 0.00 |
This paper presents a new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms. The algorithm is based on the concept of semi-partitioned scheduling, in which most tasks are fixed to specific processors, while a few tasks migrate across processors. Particularly, we design the algorithm so that tasks are qualified to migrate only if a task set cannot be partitioned any more, and such migratory tasks migrate from one processor to another processor only once in each period. The scheduling policy is then subject to Earliest Deadline First. Simulation results show that the algorithm delivers competitive scheduling performance to the state-of-the-art, with a smaller number of context switches.