Scheduling Arbitrary-Deadline Sporadic Task Systems on Multiprocessors
- 1 November 2008
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 385-394
- https://doi.org/10.1109/rtss.2008.44
Abstract
A new algorithm is proposed for scheduling preemptible arbitrary-deadline sporadic task systems upon multiprocessor platforms, with interprocessor migration permitted. This algorithm is based on a task-splitting approach - while most tasks are entirely assigned to specific processors, a few tasks (fewer than the number of processors) may be split across two processors. This algorithm can be used for two distinct purposes: for actually scheduling specific sporadic task systems, and for feasibility analysis. Simulation- based evaluation indicates that this algorithm offers a significant improvement on the ability to schedule arbitrary- deadline sporadic task systems as compared to the contemporary state-of-art. With regard to feasibility analysis, the new algorithm is proved to offer superior performance guarantees in comparison to prior feasibility tests.Keywords
This publication has 11 references indexed in Scilit:
- Scheduling Arbitrary-Deadline Sporadic Task Systems on MultiprocessorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2008
- Sporadic Multiprocessor Scheduling with Few PreemptionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2008
- The partitioned dynamic-priority scheduling of sporadic task systemsReal-Time Systems, 2007
- An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time SystemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Tardiness Bounds under Global EDF Scheduling on a MultiprocessorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Multiprocessor Scheduling with Few PreemptionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- An Optimal Real-Time Scheduling Algorithm for MultiprocessorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Mixed Pfair/ERfair scheduling of asynchronous periodic tasksJournal of Computer and System Sciences, 2004
- Proportionate progress: A notion of fairness in resource allocationAlgorithmica, 1996
- Preemptively scheduling hard-real-time sporadic tasks on one processorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990