Dealing with Soft Aperiodic Tasks in RUN

  • Flávia Maristela S. Nascimento IFBA
  • George Lima IFBA

Resumo


RUN is a scheduling policy designed for multiprocessor real-time systems, composed of periodic task sets with implicit deadlines, that guarantees up to 100% of processor utilization with reduced number of preemptions. In this paper we extend RUN to deal with task sets composed of both hard and soft tasks. Results are evaluated via simulation, which indicates that: RUNHS can deal with soft tasks; the average response time of aperiodic tasks is improved; hard deadlines are preserved while soft deadline miss ratio is kept low.

Palavras-chave: RUN, mixed task sets, slack server
Publicado
21/11/2023
Como Citar

Selecione um Formato
NASCIMENTO, Flávia Maristela S.; LIMA, George. Dealing with Soft Aperiodic Tasks in RUN. In: SIMPÓSIO BRASILEIRO DE ENGENHARIA DE SISTEMAS COMPUTACIONAIS (SBESC), 13. , 2023, Porto Alegre/RS. Anais [...]. Porto Alegre: Sociedade Brasileira de Computação, 2023 . p. 150-155. ISSN 2237-5430.