An ILP representation of a DAG scheduling problem

Baruah, Sanjoy

doi:10.1007/s11241-021-09370-7

Cited by 10 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In multicore systems, most works that use ILP for scheduling do so with the objective of minimising power consumption [20], [21]. In [22] a new method for solving complex scheduling problems of realtime in multicore platforms is proposed using a directed acyclic graph (DAG) to represent the scheduling of the workload, where each vertex represents a processor of the system. Our model differs from this work in the sense that we assume a periodic temporal model.…”

Section: Related Workmentioning

confidence: 99%

Optimized Scheduling of Periodic Hard Real-Time Multicore Systems

Aceituno¹,

Guasque²,

Balbastre³

et al. 2023

IEEE Access

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%

Optimized Scheduling of Periodic Hard Real-Time Multicore Systems

Aceituno¹,

Guasque²,

Balbastre³

et al. 2023

IEEE Access

View full text Add to dashboard Cite

show abstract

“…El survey de Davis and Burns (2011) es de obligada lectura sobre planificación en multiprocesadores. Recientemente se ha estudiado la planificación c on t écnicas ILP en Baruah (2022) para modelos de tareas que siguen un grafo acíclico directo (DAG).…”

Section: Trabajos Relacionadosunclassified

Planificación de sistemas de tiempo real crítico mediante técnicas no convencionales

Balbastre

Aceituno

Guasque

et al. 2022

Rev. iberoam. autom. inform. ind.

View full text Add to dashboard Cite

En la planificación de sistemas de tiempo real crítico es clave encontrar un plan temporal en el que las tareas pueden ejecutarse antes de que venza el plazo establecido. Para lograr este objetivo se pueden utilizar diferentes tipos de algoritmos de planificación. Además de encontrar un plan factible, muchas veces es beneficioso, de todos los planes factibles existentes, encontrar aquel que minimiza algún parámetro temporal del sistema. Existen muchos algoritmos de planificación que son capaces de encontrar una planificación correcta del conjunto de tareas. Pero no es tan común encontrar algoritmos que optimicen otros parámetros para mejorar el funcionamiento del sistemas en términos de estabilidad, consumo de potencia, etc. Los heurísticos existentes puede mejorar el comportamiento pero sin asegurar un resultado óptimo. En este trabajo exploramos las técnicas de planificación no convencionales basadas en programación lineal entera para resolver la planificación en sistemas mono procesador con el objetivo de minimizar el peor tiempo de respuesta y el cambio de contexto de las tareas del sistema y la asignación de tareas a procesadores en sistemas multiprocesador con el objetivo de minimizar la interferencia producida por el acceso a recursos hardware comunes.

show abstract

“…bound in (7) is larger than or equal to the bound in (8). Let B 0 denote the bound in (7) and B 1 denote the bound in (8).…”

Section: New Multi-path Boundmentioning

confidence: 99%

Bounding the Response Time of DAG Tasks Using Long Paths

Guan

et al. 2022

2022 IEEE Real-Time Systems Symposium (RTSS)

View full text Add to dashboard Cite

This paper studies the response time bound of a DAG (directed acyclic graph) task. Recently, the idea of using multiple paths to bound the response time of a DAG task, instead of using a single longest path in previous results, was proposed and leads to the so-called multi-path bound. Multi-path bounds can greatly reduce the response time bound and significantly improve the schedulability of DAG tasks. This paper derives a new multi-path bound and proposes an optimal algorithm to compute this bound. We further present a systematic analysis on the dominance and the sustainability of three existing multipath bounds and the proposed multi-path bound. Our bound theoretically dominates and empirically outperforms all existing multi-path bounds. What's more, the proposed bound is the only multi-path bound that is proved to be self-sustainable.

show abstract

An ILP representation of a DAG scheduling problem

Cited by 10 publications

References 15 publications

Optimized Scheduling of Periodic Hard Real-Time Multicore Systems

Optimized Scheduling of Periodic Hard Real-Time Multicore Systems

Planificación de sistemas de tiempo real crítico mediante técnicas no convencionales

Bounding the Response Time of DAG Tasks Using Long Paths

Contact Info

Product

Resources

About

An ILP representation of a DAG scheduling problem

Cited by 10 publications

References 15 publications

Optimized Scheduling of Periodic Hard Real-Time Multicore Systems

Optimized Scheduling of Periodic Hard Real-Time Multicore Systems

Planificación de sistemas de tiempo real crí­tico mediante técnicas no convencionales

Bounding the Response Time of DAG Tasks Using Long Paths

Contact Info

Product

Resources

About

Planificación de sistemas de tiempo real crítico mediante técnicas no convencionales