Real-Time Scheduling of Bounded-Delay Partitions in Hades Trusted Architecture

To enhance the dependability and security of complex embedded security safety-critical systems with multi-levels security (MLS),a trusted architecture,called Hades,is presented. Hades is based on the concept of temporal and spatial isolation and the partition mechanism. Each partition shares the physical resource and uses only a fraction of the time,and so it is free from the interference of one another. This paper also proposes a scheduling model of the bounded-delay partition to solve the scheduling problem of partitions,and designs a two-level scheduling mechanism with priority bitmap algorithm using two scheduling policies,Rate Monotonic (RM) and Earliest Deadline First (EDF).The schedulable conditions for preemptive fixed priority and dynamic priority scheduling policies are provided separately. Simulation results demonstrated the effectiveness of the proposed model.