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.

Highlights

  • For an avionic system it is not sufficient that the logical result of a computation is correct, it is crucial that the result is produced at the correct time

  • This paper addresses a pre-runtime multiprocessor scheduling problem for an avionic system with periodic tasks, where each task is beforehand assigned to a processor

  • There is a diversity in the type of scheduling required for different Integrated Modular Avionics (IMA) systems, even if they are designed in compliance with the same ARINC standard

Read more

Summary

Introduction

For an avionic system (the electronic system in an aircraft) it is not sufficient that the logical result of a computation is correct, it is crucial that the result is produced at the correct time. Most methods for the pre-runtime scheduling of large-scale real-time systems are of a heuristic nature; see for example the references in Sect. For many types of real-time systems, a primal heuristic might be an efficient and sound way to provide a schedule. This does not hold for an avionic scheduling problem when the scheduling involves determining whether or not a desired software functionality can be implemented with the existing platform. An overview of the technical design of the system is summarised, but it is not discussed to the same extent as in the real-time system research papers referred to in Sect.

System characteristics
Related research
Contributions and outline of the paper
System model
Periodic task system
Precedence relations
Communication network
Sequencing approach
Strategy
Notation
Validity of the strategy for sequencing
Tasks and sequencing
AM-scheduling
CM-scheduling
CN-scheduling
Constraint generation procedure
Relaxed problem
Subproblem
Objective functions of the relaxed problem
À tir À þ 2
Preprocessing components
Overview of scheduling tool
Benchmark formulation
Test results
Preprocessing effect
 103 11  104 6  103 5  104
Solution approach evaluation
Findings
Concluding remarks

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.