Design Optimization of Mixed-Criticality Real-Time Applications on Cost-Constrained Partitioned Architectures

Abstract

Abstract-In this paper we are interested to implement mixed-criticality hard real-time applications on a given heterogeneous distributed architecture. Applications have different criticality levels, captured by their Safety-Integrity Level (SIL), and are scheduled using static-cyclic scheduling. Mixed-criticality tasks can be integrated onto the same architecture only if there is enough spatial and temporal separation among them. We consider that the separation is provided by partitioning, such that applications run in separate partitions, and each partition is allocated several time slots on a processor. Tasks of different SILs can share a partition only if they are all elevated to the highest SIL among them. Such elevation leads to increased development costs. We are interested to determine (i) the mapping of tasks to processors, (ii) the assignment of tasks to partitions, (iii) the sequence and size of the time slots on each processor and (iv) the schedule tables, such that all the applications are schedulable and the development costs are minimized. We have proposed a Tabu Search-based approach to solve this optimization problem. The proposed algorithm has been evaluated using several synthetic and real-life benchmarks.

Optimization of Partitioned Architectures to Support Soft Real-Time Applications

“…PARTITIONED ARCHITECTURE OPTIMIZATION Next, we describe the proposed "Partitioned Architecture Optimization" (PAO) strategy. We have modified and extended our Tabu Search (TS) approach from [6] to solve the problem formulated in the previous section. TS [2] is a meta-heuristic optimization that searches for the solution that minimizes the cost function.…”

“…In [6], we have addressed the optimization of PAs for hard real-time applications, focusing on finding schedulable implementations that minimize the development and certification costs. In this paper we are not interested in the issue of cost minimization, but in supporting soft real-time applications that share the same PA with critical hard real-time applications.…”

Ingredients for the Specification of Mixed-Criticality Real-Time Systems

“…Tamas-Selicean and Pop have worked on mixed criticality by considering hard-real-time tasks of different SIL [2] levels [16]. They need to solve (1) task-to-processor mapping, (2) task-to-partition assignment, (3) slot allocation at each processor, and (4) static schedule tables.…”

Analysis and optimization of mixed-criticality applications on partitioned distributed architectures

“…Researchers have recently started to address the integration of mixed-criticality tasks onto the same platform [4], [14]. In [14], we proposed an optimization approach to determine the mapping of tasks to PEs, the time partitions on each PE 1 Fig.…”

“…In [14], we proposed an optimization approach to determine the mapping of tasks to PEs, the time partitions on each PE 1 Fig. 1: Application model example and the schedule tables, such that all applications are schedulable and the development costs are minimized.…”