Performance-Based Scheduling in Distributed Mixed Criticality Systems

With a focus on computationally intensive, distributed, and parallel workloads, scheduling in mixed-criticality distributed systems presents significant challenges due to shared memory and resources, as well as the diverse demands of tasks. The system's efficiency is heavily dependent on the overall scheduling duration (make span), while individual task deadlines impose strict timing constraints. When the tasks need to simultaneously access the shared memory, then these tasks interfere the execution of one another. For managing the scheduling of interfering tasks in distributed mixed-criticality systems, a novel Interference-Aware Partitioning Fixed Priority (IAP-FP) approach is proposed, which effectively handles task partitioning among cores while considering interference, ensuring better performance and adherence to critical deadlines. This method reduces task waiting times, which minimizes the scheduling duration and improving the schedulability of the task set. The novel proposed approach is compared with Mixed-Criticality Multicore Compositional Earliest Deadline First (MMC-EDF), Global and Mixed Criticality Partitioning (MC-Partitioning) approaches to show the efficiency. The proposed approach schedules 75% tasks while the MMC-EDF, Global and MC-Partitioning approaches schedules 65%, 0% and 18% tasks respectively for target utilization U=0.8. As the utilization of mixed criticality (MC) workload increases, the schedulability of MC task sets decreases, but still the proposed approach performs better than the MMC-EDF, Global and MC-partitioning approaches.