A Necessary and Sometimes Sufficient Condition for the Feasibility of Sets of Sporadic Hard-Deadline Tasks

Authors:
Theodore P. Baker;Michele Cirinei
Affiliations:
Florida State University, USA;Scuola Superiore Sant'Anna, Italy
Venue:
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Year:
2006

Citing 0
Cited 13

EDZL scheduling analysis

Real-Time Systems
The feasibility of general task systems with precedence constraints on multiprocessor platforms

Real-Time Systems
An analysis of global edf schedulability for arbitrary-deadline sporadic task systems

Real-Time Systems
Brute-force determination of multiprocessor schedulability for sets of sporadic hard-deadline tasks

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible

Real-Time Systems
Improved multiprocessor global schedulability analysis

Real-Time Systems
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)
Zero-laxity based real-time multiprocessor scheduling

Journal of Systems and Software
Laxity dynamics and LLF schedulability analysis on multiprocessor platforms

Real-Time Systems
FPSL, FPCL and FPZL schedulability analysis

Real-Time Systems
Contention-free executions for real-time multiprocessor scheduling

ACM Transactions on Embedded Computing Systems (TECS) - Special Section ESFH'12, ESTIMedia'11 and Regular Papers
Demand-based schedulability analysis for real-time multi-core scheduling

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

This report describes a necessary condition for feasibility of scheduling a set of sporadic hard-deadline tasks on identical multiprocessor platforms, which is also a sufficient condition if there is only a single processor. The key contribution is the characterization of the maximum, over all time intervals of a given length, of the amount of computation that must be completed to meet all deadlines, and a method of computing this function efficiently to any desired degree of accuracy. Empirical data are provided to verify that the new infeasibility test can be computed efficiently and is an improvement over previously known checks for infeasibility.