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

Authors:
Theodore P. Baker;Michele Cirinei
Affiliations:
Florida State University, Tallahassee, FL;Scuola Superiore Sant'Anna, Pisa, Italy
Venue:
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Year:
2007

Citing 10
Cited 12

Deadline-based scheduling of periodic task systems on multiprocessors

Information Processing Letters
Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors

Real-Time Systems
Static-Priority Scheduling on Multiprocessors

RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
An Analysis of EDF Schedulability on a Multiprocessor

IEEE Transactions on Parallel and Distributed Systems
Improved Schedulability Analysis of EDF on Multiprocessor Platforms

ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
An Analysis of Fixed-Priority Schedulability on a Multiprocessor

Real-Time Systems
Predictability of Earliest Deadline Zero Laxity Algorithm for Multiprocessor Real-Time Systems

ISORC '06 Proceedings of the Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing
A Necessary and Sometimes Sufficient Condition for the Feasibility of Sets of Sporadic Hard-Deadline Tasks

RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
EDZL Scheduling Analysis

ECRTS '07 Proceedings of the 19th Euromicro Conference on Real-Time Systems
New schedulability tests for real-time task sets scheduled by deadline monotonic on multiprocessors

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems

EDZL scheduling analysis

Real-Time Systems
Concurrent tree traversals for improved mission performance under limited communication range

IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible

Real-Time Systems
Improved multiprocessor global schedulability analysis

Real-Time Systems
Feasibility analysis of sporadic real-time multiprocessor task systems

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Exact schedulability tests for real-time scheduling of periodic tasks on unrelated multiprocessor platforms

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

Journal of Systems Architecture: the EUROMICRO Journal
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
On using adversary simulators to obtain tight lower bounds for response times

Proceedings of the 27th Annual ACM Symposium on Applied Computing
On using adversary simulators to evaluate global fixed-priority and FPZL scheduling of multiprocessors

Journal of Systems and Software
Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm

Real-Time Systems
Feasibility intervals for homogeneous multicores, asynchronous periodic tasks, and FJP schedulers

Proceedings of the 21st International conference on Real-Time Networks and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This report describes a necessary and sufficient test for the schedulability of a set of sporadic hard-deadline tasks on a multiprocessor platform, using any of a variety of scheduling policies including global fixed task-priority and earliest-deadline-first (EDF). The contribution is to establish an upper bound on the computational complexity of this problem, for which no algorithm has yet been described. The compute time and storage complexity of the algorithm, which performs an exhaustive search of a very large state space, make it practical only for tasks sets with very small integer periods. However, as a research tool, it can provide a clearer picture than has been previously available of the real success rates of global preemptive priority scheduling policies and low-complexity sufficient tests of schedulability.