Scheduling Arbitrary-Deadline Sporadic Task Systems on Multiprocessors

Authors:
Björn Andersson;Konstantinos Bletsas;Sanjoy Baruah
Affiliations:
-;-;-
Venue:
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Year:
2008

Citing 0
Cited 14

Optimal virtual cluster-based multiprocessor scheduling

Real-Time Systems
Cluster scheduling for real-time systems: utilization bounds and run-time overhead

Real-Time Systems
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)
Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound

Real-Time Systems
DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling

Real-Time Systems
CPU scheduling and memory management for interactive real-time applications

Real-Time Systems
Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme

Real-Time Systems
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
Dynamic Cache Reconfiguration for Soft Real-Time Systems

ACM Transactions on Embedded Computing Systems (TECS)
CloudIQ: a framework for processing base stations in a data center

Proceedings of the 18th annual international conference on Mobile computing and networking
FPSL, FPCL and FPZL schedulability analysis

Real-Time Systems
Harmonic semi-partitioned scheduling for fixed-priority real-time tasks on multi-core platform

DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new algorithm is proposed for scheduling preemptiblearbitrary-deadline sporadic task systems upon multiprocessorplatforms, with interprocessor migration permitted. This algorithmis based on a task-splitting approach --- while most tasks areentirely assigned to specific processors, a few tasks (fewer thanthe number of processors) may be split across two processors. Thisalgorithm can be used for two distinct purposes: for actuallyscheduling specific sporadic task systems, and for feasibilityanalysis.Simulation-based evaluation indicates that this algorithm offers asignificant improvement on the ability to schedulearbitrary-deadline sporadic task systems as compared to thecontemporary state-of-art.With regard to feasibility analysis, the new algorithm is proved tooffer superior performance guarantees in comparison to priorfeasibility tests.