In hard real-time embedded systems, switching to multicores is a step that most application domains delay as much as possible. This is mainly due to the number of sources of indeterminism, which mainly involve shared hardware resources, such as buses, caches, and memories. In this paper, a new task model that considers the interference that task execution causes in other tasks running on other cores due to memory contention is proposed. We propose a scheduling algorithm that calculates the exact interference. We also analyse and compare existing partitioning algorithms and propose three strategies to allocate tasks to cores to schedule as many tasks as possible and minimise total interference.

在硬实时嵌入式系统中，切换到多核是大多数应用程序域尽可能延迟的步骤。这主要是由于不确定性的来源数量多，主要涉及共享硬件资源，例如总线、缓存和内存。在本文中，提出了一种新的任务模型，该模型考虑了由于内存争用导致任务执行对其他内核上运行的其他任务造成的干扰。我们提出了一种计算精确干扰的调度算法。我们还分析和比较了现有的分区算法，并提出了三种策略来将任务分配给内核以调度尽可能多的任务并最大限度地减少总干扰。