Timing Analysis of Mixed-Criticality Hard Real-Time Applications Implemented on Distributed Partitioned Architectures

In this paper we are interested in the timing anal-ysis of mixed-criticality embedded real-time applications mapped on distributed heterogeneous architectures. Mixed-criticality tasks can be integrated onto the same architec-ture only if there is enough spatial and temporal separa-tion among them. We consider that the separation is pro-vided by partitioning, such that applications run in separate partitions, and each partition is allocated several time slots on a processor. Each partition can have its own schedul-ing policy. We are interested to determine the worst-case response times of tasks scheduled in partitions using fixed-priority preemptive scheduling. We have extended the state-of-the-art algorithms for schedulability analysis to take into account the partitions. The proposed algorithm has been evaluated using several synthetic and real-life benchmarks.