Non-Preemptive Scheduling of Periodic Mixed-Criticality Real-Time Systems

Singh, Jasdeep; Santinelli, Luca; Reghenzani, Federico; Bletsas, Konstantinos; Guo, Zhishan

http://hdl.handle.net/10400.22/16388

Utilize este identificador para referenciar este registo.

Nome:	Descrição:	Tamanho:	Formato:
COM_CISTER_Bletsas_2020.pdf		584.93 KB	Adobe PDF	Ver/Abrir

Contacte-nos

Autores

Singh, Jasdeep

Santinelli, Luca

Reghenzani, Federico

Bletsas, Konstantinos

Guo, Zhishan

Resumo(s)

In this work we develop an offline analysis of periodic mixed-criticality real-time systems. We develop a graph-based exploratory method to non-preemptively schedule multiple criticality tasks. The exploration process obtains a schedule for each periodic instance of the tasks. The schedule adjusts for criticality mode changes to maximize the resource usage by allowing lower criticality executions. At the same time, it ensures that the schedulability of other higher criticality jobs is never compromised. We also quantify the probabilities associated to a criticality mode change by using task probabilistic Worst Case Execution Times. A method to reduce the offline complexity is also proposed.

Palavras-chave

Real-Time System Mixed Criticality Graph Probabilistic Worst Case Execution Time

URI

http://hdl.handle.net/10400.22/16388

Coleções

ISEP – CISTER – Comunicações em eventos científicos

Ver registo completo