Abstract: To address the scheduling problem in high-assurance software architecture for embedded systems, this article analyzes the limitation of partition scheduling methods of existing security systems and presents a static scheduling model based on period partition. By means of this model a two-level scheduling mechanism is constructed with priority bitmap algorithm. This article introduces two scheduling policies for tasks in partitions: fixed priority and dynamic priority based on the earliest deadline first (EDF) scheduling algorithm. The scheduling conditions and schedulability of tasks are studied, and the schedulable conditions of dynamic priority tasks are proposed. The accuracy of the scheduling conditions in this article is verified through a simulation experiment.

Key words: embedded security/safety-critical system, ARINC-653, time and space separation, static model, scheduling, two-level scheduling mechanism