Sustainable Multiprocessor Scheduling of Sporadic Task Systems

Authors:
Theodore P. Baker;Sanjoy K. Baruah
Affiliations:
-;-
Venue:
ECRTS '09 Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems
Year:
2009

Citing 0
Cited 11

Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems

Real-Time Systems
Global EDF-based scheduling with laxity-driven priority promotion

Journal of Systems Architecture: the EUROMICRO Journal
Schedulability analysis for non-preemptive fixed-priority multiprocessor scheduling

Journal of Systems Architecture: the EUROMICRO Journal
Tests for global EDF schedulability analysis

Journal of Systems Architecture: the EUROMICRO Journal
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
What to make of multicore processors for reliable real-time systems?

Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
FPSL, FPCL and FPZL schedulability analysis

Real-Time Systems
Sustainability in static-priority restricted-migration scheduling

Proceedings of the 2012 ACM Research in Applied Computation Symposium
Schedulability analysis for Controller Area Network (CAN) with FIFO queues priority queues and gateways

Real-Time Systems
Global EDF scheduling of directed acyclic graphs on multiprocessor systems

Proceedings of the 21st International conference on Real-Time Networks and Systems
Mixed-criticality scheduling on multiprocessors

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A scheduling policy or a schedulability test is defined to be sustainable with respect to a particular workload model if any task system represented in that model that is determined to be schedulable remains so if it behaves "better" than mandated by its specifications. We investigate the sustainability properties of global scheduling algorithms when applied to systems represented using the sporadic task model. We show that Fixed-Priority (FP) scheduling of sporadic task sets is sustainable under a variety of scheduling parameter relaxations, including decreased execution requirements, later arrivals, and deadline relaxations. It follows that all sufficient tests of global FP schedulability are sustainable for sporadic task systems. We show that the Earliest Deadline First (EDF) and Earliest-Deadline with Zero Laxity scheduling policies are sustainable with respect to decreased execution requirements and later arrivals. We also introduce a notion of self-sustainability, and show that many widely-used EDF schedulability tests are not self-sustainable but one is.