Job Replication in Mixed-Criticality Scheduling

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F18%3A00328947" target="_blank" >RIV/68407700:21730/18:00328947 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Job Replication in Mixed-Criticality Scheduling

Original language description

In mixed-criticality scheduling, jobs with different safety requirements share a common resource. The jobs have multiple different processing times that are subject to uncertainty which influences other jobs. Under a specific realization of processing times, a less critical job may be rejected to compensate prolongation of a more critical one. Hence, jobs can have different probabilities of the execution, depending on the schedule. Typically, one wants to maximize the execution probability which can be done by scheduling the same job more than once in different parts of the schedule, i.e., replicate them. In this report, we study the computational complexity of job replication in mixed-criticality scheduling. The problem is, given a schedule with mixed-criticality jobs with replication, to compute the execution probability of a job. Furthermore, we show applications of the mixed-criticality model to manufacturing.

Czech name

—

Czech description

—

Type

O - Miscellaneous

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/EG15_019%2F0004688" target="_blank" >EG15_019/0004688: Factory of the future</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2018

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů