Feasibility intervals for homogeneous multicores, asynchronous periodic tasks, and FJP schedulers

Authors:
Vincent Nelis;Patrick Meumeu Yomsi;Joël Goossens
Affiliations:
ISEP, Polytechnic Institute of Porto;ISEP, Polytechnic Institute of Porto;Université Libre de Bruxelles (ULB)
Venue:
Proceedings of the 21st International conference on Real-Time Networks and Systems
Year:
2013

Citing 10
Cited 0

Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor

Real-Time Systems
Sustainable Scheduling Analysis

RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms

RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
New Response Time Bounds for Fixed Priority Multiprocessor Scheduling

RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
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
Exact schedulability tests for real-time scheduling of periodic tasks on unrelated multiprocessor platforms

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

Journal of Systems Architecture: the EUROMICRO Journal
A unified analysis of global EDF and fixed-task-priority schedulability of sporadic task systems on multiprocessors

Journal of Embedded Computing
Scheduling of hard real-time multi-phase multi-thread (MPMT) periodic tasks

Real-Time Systems
Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the problem of scheduling asynchronous periodic real-time tasks on homogeneous multicore platforms using a global and Fixed Job-level Priority (FJP) scheduler, e.g., global-EDF (global Earliest Deadline First). We establish a finite interval of time such that, if no task deadline is missed while scheduling only the jobs released within this interval, then no task deadline will ever be missed at run time. This kind of interval is referred to as "feasibility interval" and allows for sufficient and necessary schedulability analyses.