Heterogeneous MPSoCs are being used more and more, from cellphones to critical embedded systems. Most of those systems offer heterogeneous sets of identical cores. In this paper, we propose new results on the global scheduling approach. We extend fundamental global scheduling results on unrelated processors to results on unrelated multicore platforms, a more realistic model. We introduce several methods to construct the workload assignment of tasks to cores taking advantage of this new model. Every studied result is optimal regarding schedulability, and all the proposed methods but one have a polynomial time complexity. Thanks to the model, the produced schedules have a limited degree of migrations. The benefits of the methods are demonstrated and compared using synthetic tasks sets. Practical limitations of the global scheduling approach on unrelated platforms are discussed, but we argue that it is still worth investigating considering modern MPSoCs.

从手机到关键的嵌入式系统，异构MPSoC的使用越来越多。这些系统中的大多数都提供相同内核的异构集合。在本文中，我们提出了有关全局调度方法的新结果。我们将不相关处理器上的基本全局调度结果扩展到不相关多核上的结果平台，更现实的模型。我们介绍了几种利用此新模型来构造任务向核心的工作负载分配的方法。关于可调度性，每一项研究结果都是最优的，除一种方法外，所有提出的方法都具有多项式时间复杂度。由于有了该模型，所生成的计划表的迁移程度有限。使用综合任务集演示并比较了这些方法的好处。讨论了在不相关平台上使用全局调度方法的实际局限性，但我们认为仍然值得研究现代MPSoC。