Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods

Eisenbrand, Friedrich; Karthikeyan, K.; Mattikalli, Raju; Niemeier, Martin; Nordsieck, A.W.; Skutella, Martin; Verschae, José; Wiese, Andreas

doi:10.1007/978-3-642-15775-2_2

Cited by 24 publications

(21 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We have tested the method on non-harmonic instances generated using the procedure described in Eisenbrand et al (2010b): the periods were chosen in the set {2 x 3 y 50 | x ∈ [0, 4], y ∈ [0, 3]}, and the processing times were generated following an inverse exponential distribution and averaging at about 20 % of the period of the task.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Line search method for solving a non-preemptive strictly periodic scheduling problem

Pira

Artigues

2014

J Sched

View full text Add to dashboard Cite

This paper is an extended version of the paper published In G. Kendall, G. Vanden Berghe, and B. McCollum, editors, 6 th Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), pages 356-371, Ghent, Belgium, 2013. ISSN: 2305-249XInternational audienceWe study a non-preemptive strictly periodic scheduling problem. This problem arises for example in the avionic field where a set of N periodic tasks (measure of a sensor, data presentation, etc.) has to be scheduled on P processors distributed on the plane. In this article, we consider an existing heuristic which is based on the notion of equilibrium. Following a game theory analogy, each task tries successively to optimize its own schedule and therefore to produce the best response, given the other schedules. We present a new method to compute the best response, and a propagation mechanism for non-overlapping constraints, which signi cantly improves this heuristic. These improvements allow the heuristic to compare favorably with MILP solutions

show abstract

Section: Resultsmentioning

confidence: 99%

“…Note that variables (x i, j ) can be relaxed to be continuous variables (even unbounded), instead of binary ones 4 . We obtain the following program (Eisenbrand et al 2010b):…”

Section: Multiprocessor Problemmentioning

confidence: 99%

Line search method for solving a non-preemptive strictly periodic scheduling problem

Pira

Artigues

2014

J Sched

View full text Add to dashboard Cite

show abstract

“…En (Eisenbrand et al, 2010) se propone un método híbrido basado en heurísticos y formulaciones matemáticas para resolver el despliegue y planificación de tareas periódicas en siste-mas de tiempo real distribuidos. La arquitectura corresponde a la de un avión, y se divide en dos cabinets, formados por elementos procesadores idénticos comunicados mediante una red de comunicaciones.…”

Section: Heurísticos (Heu)unclassified

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

Amurrio

Azketa

Gutiérrez

et al. 2019

Rev. iberoam. autom. inform. ind.

View full text Add to dashboard Cite

<p>En las últimas tres décadas, se ha realizado un gran número de propuestas sobre la optimización del despliegue y planificación de sistemas de tiempo real distribuidos bajo diferentes enfoques algorítmicos que aportan soluciones aceptables a este problema catalogado como NP-difícil. En la actualidad, la mayor parte de los sistemas utilizados en el sector industrial son sistemas de criticidad mixta en los que se puede usar la planificación cíclica, las prioridades fijas y el particionado, que proporciona aislamiento temporal y espacial a las aplicaciones. Así, en este artículo se realiza una revisión de los trabajos publicados sobre este tema y se presenta un análisis de las diferentes soluciones aportadas para sistemas de tiempo real distribuidos basados en las políticas de<br />planificación que se están usando en la práctica. Como resultado de la comparación, se presenta una tabla a modo de guía en la que se relacionan los trabajos revisados y se caracterizan sus soluciones.</p>

show abstract

“…For all our formulations here we discuss only the case that there is one single processor for which a schedule has to be found. This can easily be generalized to a setting with multiple processors [1].…”

Section: Three Problem Formulationsmentioning

confidence: 99%

Real-time Avionics Optimization

Eisenbrand

Niemeier

Skutella

et al. 2011

It - Information Technology

Self Cite

View full text Add to dashboard Cite

SummaryWe report on the solution of a difficult optimization problem which arises in avionics industry. When constructing the on-board controlling-network of an airplane, the engineers need to solve a computationally highly complex problem. The goal is to assign periodic tasks to the processors on the plane and define a schedule for each processor. Current state-of-the-art approaches to tackle the problem are by far not powerful enough to solve instances of real-world size. With the help of the powerful algorithm engineering paradigm we analyzed the mathematical properties of the scheduling problem and designed sophisticated software based on the structural insights. We were able to design a model that outperformed current state-of-the-art approaches by several orders of magnitude. In particular, we could solve industrial size real-world instances to optimality. Our methods lead, for the first time, to an industrial strength tool to schedule aircraft sized instances. Zusammenfassung

show abstract

Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods

Cited by 24 publications

References 15 publications

Line search method for solving a non-preemptive strictly periodic scheduling problem

Line search method for solving a non-preemptive strictly periodic scheduling problem

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

Real-time Avionics Optimization

Contact Info

Product

Resources

About