Hardware resources contention-aware scheduling of hard real-time multiprocessor systems

Aceituno, José María; Guasque, Ana; Balbastre, Patricia; Simó, José; Crespo, Alfons

doi:10.1016/j.sysarc.2021.102223

Cited by 9 publications

(32 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In [17], the interference due to contention is added to the temporal model. Instead of adding it to the WCET, they propose a scheduling algorithm that computes the exact value of interference and an allocator that tries to reduce this total interference.…”

Section: Related Workmentioning

confidence: 99%

“…A more detailed description of the interference factor parameter can be found in [17] but, because of its importance, we will illustrate how to schedule the task model with a simple example. First, we need the following definitions: Definition 1: [17] A task is defined as a receiving task when it accesses shared hardware resources and suffers an increase in its computation time due to the interference produced by other tasks allocated to other cores. Definition 2: [17] A task is defined as a broadcasting task when it accesses shared hardware resources and provokes an increase in computation time in other tasks allocated to other cores due to contention.…”

Section: Task Model and Problem Statement A Periodic Task Modelmentioning

confidence: 99%

See 1 more Smart Citation

Optimized Scheduling of Periodic Hard Real-Time Multicore Systems

Aceituno¹,

Guasque²,

Balbastre³

et al. 2023

IEEE Access

Self Cite

View full text Add to dashboard Cite

Multicore systems were developed to provide a substantial performance increase over monocore systems. But shared hardware resources are a problem as they add unpredictable delays that affect the schedulability of multicore hard real-time systems. In recent years much effort has been put into modelling interference and proposing scheduling techniques to mitigate its negative effect. Using one of these models, we propose a scheduling technique, based on Integer Linear Programming (ILP) that, in combination with a task to core allocator, not only achieves a feasible schedule but also reduces the interference produced by shared hardware resources in the context of hard real-time multicore systems. The evaluation shows how both the interference is reduced (≈ 83.47%) and the schedulability is increased (≈ 12.25%) compared to traditional heuristics.INDEX TERMS integer linear programming, optimization, partitioned systems, real-time systems, static scheduling I. INTRODUCTION

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Task Model and Problem Statement A Periodic Task Modelmentioning

confidence: 99%

Optimized Scheduling of Periodic Hard Real-Time Multicore Systems

Aceituno¹,

Guasque²,

Balbastre³

et al. 2023

IEEE Access

Self Cite

View full text Add to dashboard Cite

show abstract

“…La mayoría de trabajos que tratan de reducir esta interferencia, lo hacen para algún tipo específico de recurso hardware: bus de memoria ( [2], [8]), memoria DRAM [7]. En nuestro caso, adoptamos un modelo general para cualquier tipo de recurso de forma similar a como se hace en [1] y [4].…”

Section: Trabajos Relacionadosunclassified

“…Así que este tiempo de interferencia se define independientemente de C i , ya que se utilizará para representar el retraso causado a otras tareas. Una descripción detallada de este parámetro se puede encontrar en [1]. Asumimos plazos limitados, por lo que D i ≤ T i .…”

Section: Modelo De Tareasunclassified

“…Con respecto a algoritmos de asignación que buscan, no solo alojar las tareas sino minimizar algun parametro temporal, destacamos el algoritmo Wmin [1] que, mediante programación lineal entera, obtiene la asignación óptima para minimizar la interferencia total generada por el uso de recursos hardware compartidos.…”

Section: Planificación De Sistemas De Tiempo Real Crítico Multinúcleounclassified

See 1 more Smart Citation

Planificador combinado: una estrategia para mejorar el rendimiento de los sistemas de tiempo real crítico

Aceituno¹,

Ortega²,

Betoret³

et al. 2022

XLIII Jornadas De Automática: Libro De Actas: 7, 8 Y 9 De Septiembre De 2022, Logroño (La Rioja)

View full text Add to dashboard Cite

En este trabajo se propone y evalúa una nueva política de planificación en sistemas multinúcleo de tiempo real. La planificación combinada trata de establecer una nueva estrategia de planificación que reduzca los cambios de contexto y las interferencias generadas con el uso de recursos compartidos entre los núcleos. Esta estrategia se basa en la idea de elegir la mejor política para un determinado intervalo de ejecución durante todo el plan. El resultado es una planificación de tareas implementada con diferentes políticas como EDF (Earliest Deadline First) o DM (Deadline Monotonic) y variantes de las mismas. Se ha evaluado la propuesta con diferente número de núcleos y carga obteniendo mejoras con respecto al uso de un solo planificador en todo el horizonte de ejecución.

show abstract