DeepAI AI Chat
Log In Sign Up

Predictability of Fixed-Job Priority Schedulers on Heterogeneous Multiprocessor Real-Time Systems

08/25/2009
by   Liliana Cucu-Grosjean, et al.
0

The multiprocessor Fixed-Job Priority (FJP) scheduling of real-time systems is studied. An important property for the schedulability analysis, the predictability (regardless to the execution times), is studied for heterogeneous multiprocessor platforms. Our main contribution is to show that any FJP schedulers are predictable on unrelated platforms. A convenient consequence is the fact that any FJP schedulers are predictable on uniform multiprocessors.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/07/2017

A Reconnaissance Attack Mechanism for Fixed-Priority Real-Time Systems

In real-time embedded systems (RTS), failures due to security breaches c...
11/18/2021

EDF-Like Scheduling for Self-Suspending Real-Time Tasks

In real-time systems, schedulability tests are utilized to provide timin...
12/24/2013

Bounded Recursive Self-Improvement

We have designed a machine that becomes increasingly better at behaving ...
01/16/2020

On Schedulability Analysis of EDF Scheduling by Considering Suspension as Blocking

During the execution of a job, it may suspend itself, i.e., its computat...
04/10/2018

Some parametrized dynamic priority policies for 2-class M/G/1 queues: completeness and applications

Completeness of a dynamic priority scheduling scheme is of fundamental i...
06/26/2018

Process Network Models for Embedded System Design Based on the Real-Time BIP Execution Engine

Existing model-based processes for embedded real-time systems support th...