Model-based optimization of ARINC-653 partition scheduling

Pujie Han*, Zhengjun Zhai, Brian Nielsen, Ulrik Nyman

*Corresponding author

Research output: Contribution to journalJournal articleResearchpeer-review

14 Downloads (Pure)

Abstract

The architecture of ARINC-653 partitioned scheduling has been widely applied to avionics systems owing to its robust temporal isolation among applications. However, this partitioning mechanism causes the problem of how to optimize the partition scheduling of a complex system while guaranteeing its schedulability. In this paper, a model-based optimization approach is proposed. We formulate the problem as a parameter sweep application, which searches for the optimal partition scheduling parameters with respect to minimum processor occupancy via an evolutionary algorithm. An ARINC-653 partitioned scheduling system is modeled as a set of timed automata in the model checker UPPAAL. The optimizer tentatively assigns parameter settings to the models and subsequently invokes UPPAAL to verify schedulability as well as evaluate promising solutions. The parameter space is explored with an evolutionary algorithm that combines refined genetic operators and the self-adaptation of evolution strategies. The experimental results show the applicability of our optimization method.
Original languageEnglish
JournalInternational Journal on Software Tools for Technology Transfer
ISSN1433-2787
DOIs
Publication statusPublished - 7 Feb 2021

Keywords

  • Evolutionary algorithm
  • Model-based optimization
  • Parameter sweep
  • Partitioned scheduling
  • Timed automata
  • UPPAAL

Fingerprint Dive into the research topics of 'Model-based optimization of ARINC-653 partition scheduling'. Together they form a unique fingerprint.

Cite this