An optimisation approach for pre-runtime scheduling of tasks and communication in an integrated modular avionic system

Abstract

In modern integrated modular avionic systems, applications share hardware resources on a common avionic platform. Such an architecture necessitates strict requirements on the spatial and temporal partitioning of the system to prevent fault propagation between different aircraft functions. One way to establish a temporal partitioning is through pre-runtime scheduling of the system, which involves creating a schedule for both tasks and a communication network. While avionic systems are growing more and more complex, so is the challenge of scheduling them. The scheduling of the system has an important role in the development of new avionic systems, since functionality is typically added to the system over a period of several years and a scheduling tool is used both to detect if the platform can host the new functionality and, if this is possible, to create a new schedule. For this reason an exact solution strategy for avionics scheduling is preferred over a heuristic one. In this paper we present a mathematical model for an industrially relevant avionic system and present a constraint generation procedure for the scheduling of such systems. We apply our optimisation approach to instances provided by our industrial partner. These instances are of relevance for the development of future avionic systems and contain up to 20,000 tasks to be scheduled. The computational results show that our optimisation approach can be used to create schedules for such instances within a reasonable time.

Una revisión de técnicas para la optimización del despliegue y planificación de sistemas de tiempo real distribuidos

“…En (Blikstad et al, 2018) se desarrolla un algoritmo basado en MILP para planificar tareas periódicas en sistemas de tiempo real distribuidos basados en la arquitectura IMA. Mediante la formulación matemática de las restricciones y requisitos de tiempo real del sistema, se construye un ejecutivo cíclico cuyo periodo es el mínimo común múltiplo de los periodos de las tareas.…”

“…) Sí Cíclica Respuesta (Hou et al, 1994) Sí Cíclica Respuesta (Monnier et al, 1998) Sí Cíclica Respuesta D = T (Dick and Jha, 1998) Sí Cíclica Coste Energia T < D (Faucou et al, 2000) Sí Cíclica D = T (Oh and Wu, 2004) Sí Cíclica Número Respuesta (Yoo, 2009) Sí Cíclica Número Respuesta (Hamann et al, 2006) Prioridades D < T (Shang et al, 2007) Sí Cíclica Coste Energia Sí (Samii et al, 2009) Prioridades Respuesta (Azketa et al, (Zheng et al, 2007a) Prioridades (Zhu et al, 2009) Sí Prioridades T harmónicos (Al Sheikh et al, 2010) Cíclica (Zhu et al, 2012) Sí Prioridades Respuesta (Blikstad et al, 2018) Sí Jerárquica CSP ) Sí Jerárquica D ≤ T MIP (Zhang et al, 2014) Cíclica ILP (Althaus et al, 2014) Sí Cíclica D ≤ T SMT -ILP (Minaeva et al, 2018) Cíclica BB (Hou and Shin, 1997) Sí Cíclica (Peng et al, 1997) Sí Cíclica Respuesta (Richard et al, 2003) Sí Prioridades HEU (Gutiérrez and González Harbour, 1995) Prioridades Respuesta (Ramamritham, 1995) Sí Cíclica D = T (Braun et al, 2001) Sí Cíclica Respuesta (Braun et al, 2008) Sí Cíclica Respuesta (Ali et al, 2002) Sí RR (Pedreiras and Almeida, 2004) Sí Prioridades / Cíclica D = T (Eles et al, 2000) Sí Cíclica Respuesta (Pop et al, 2000) Sí Cíclica Respuesta (Pop et al, 2001a) Prioridades D ≤ T (Pop et al, 2004c) Sí Cíclica D ≤ T (Pop, 2007) Sí Prioridades / Cíclica (Qin and Jiang, 2006) Sí Prioridades Respuesta (Neukirchner et al, 2011) Prioridades Respuesta (Eisenbrand et al, 2010) Cíclica Número T harmónicos…”

A matheuristic approach to large-scale avionic scheduling

“…This work addresses the scheduling of an industrially relevant Integrated Modular Avionic (IMA) system, that was introduced in Blikstad et al (2018). This problem can be considered as a multiprocessor scheduling problem, where the tasks have multiple time windows and precedence relations between them, combined with the scheduling of a communication network.…”

“…To send a communication message involves the execution of certain tasks on the involved modules and for this reason, the task and communication scheduling are closely integrated. Compared to the problem formulation used in Blikstad et al (2018), we here also include the possibility of co-allocation of messages in a time slot as introduced in Rönnberg (2018). There is no objective function and the purpose of the scheduling is to find a feasible solution or to conclude that none exists.…”

“…The future industrial need is a capability to solve very large-scale instances of avionics scheduling problems of this kind and the contributions of this paper are extensions of previous work that facilitate this. In the previous works Blikstad et al (2018), Karlsson and Rönnberg (2018), and Rönnberg (2018), the largest instance solved has 15 modules and about 20,000 tasks (about 50% of these are fixed tasks and 6000 of the tasks are placed on the most occupied module).…”