This paper tackles the problem of admitting real-time tasks on non-symmetric multiprocessor platforms, where partitioned EDF-FF is used. We extend the already obtained results for symmetric multiprocessor platforms and provide an improved equation based on the number of tasks in the taskset that considers the first few heaviest tasks in the taskset. This equation has been enveloped in three effective and efficient admission tests that are suitable for being used online and in dynamic environments to partition and admit tasks on NUMP platforms and, specifically, on ARM big.LITTLE architectures. This results in an improvement of the state of the art in terms of the considered architectures and looks promising in terms of admitted tasksets as shown by an extensive number of tests performed on tasksets generated randomly with the widely adopted randfixedsum algorithm.

本文解决了在使用分区 EDF-FF 的非对称多处理器平台上接受实时任务的问题。我们扩展了对称多处理器平台已经获得的结果，并提供了一个基于任务集中任务数量的改进方程，该方程考虑了任务集中前几个最重的任务。该等式包含在三个有效且高效的准入测试中，这些测试适用于在线和动态环境中，用于在 NUMP 平台上，特别是在 ARM big.LITTLE 架构上划分和承认任务。这导致在所考虑的体系结构方面改进了现有技术，并且在承认的任务集方面看起来很有希望，如对广泛采用的随机生成的任务集执行的大量测试所示随机数算法。