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

[EN] In the scheduling of hard real time systems it is key to find a temporal plan in which tasks can be executed before the deadline expires. Different types of scheduling algorithms can be used to achieve this goal. In addition to finding a feasible plan, it is often beneficial, out of all existin...

Descripción completa

Detalles Bibliográficos
Autores: Balbastre, Patricia|||0000-0001-9458-4083, Aceituno, José María, Guasque, Ana, Blanes, Juan Francisco, Crespo, Alfons, Poza, José Luis
Tipo de recurso: artículo
Fecha de publicación:2022
País:España
Institución:Universitat Politècnica de València (UPV)
Repositorio:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Idioma:español
OAI Identifier:oai:riunet.upv.es:10251/187022
Acceso en línea:https://riunet.upv.es/handle/10251/187022
Access Level:acceso abierto
Palabra clave:Real-time control systems
Control system scheduling
Cyber physical systems
Embedded control systems
Sistemas de control de tiempo real
Sistemas de control embebidos o empotrados
Planificación y planificabilidad de sistemas de control
Sistemas ciber-físicos en control
Descripción
Sumario:[EN] In the scheduling of hard real time systems it is key to find a temporal plan in which tasks can be executed before the deadline expires. Different types of scheduling algorithms can be used to achieve this goal. In addition to finding a feasible plan, it is often beneficial, out of all existing feasible plans, to find one that minimises some time parameter of the system. There are many scheduling algorithms that are able to find a correct scheduling of the set of tasks, but it is not so common to find algorithms that optimise other parameters to improve the performance of the system in terms of stability, power consumption, etc. Existing heuristics can improve the performance but without ensuring an optimal result. In this work we explore unconventional scheduling techniques based on integer linear programming to solve scheduling in mono processor systems with the objective of minimising the worst-case response time of the system tasks and the assignment of tasks to processors in multiprocessor systems with the objective of minimising the interference produced by the access to common hardware resources.