In this paper, we propose the first optimum process scheduling algorithm for an increasingly prevalent type of heterogeneous multicore (HEMC) system that combines high-performance big cores and energy-efficient small cores with the same instruction-set architecture (ISA). Existing algorithms are all heuristics-based, and the well-known IPC-driven approach essentially tries to schedule high scaling factor processes on big cores. Our analysis shows that, for optimum solutions, it is also critical to consider placing long running processes on big cores. Tests of SPEC 2006 cases on various big-small core combinations show that our proposed optimum approach is up to 34% faster than the IPC-driven heuristic approach in terms of total workload completion time. The complexity of our algorithm is O(NlogN) where N is the number of processes. Therefore, the proposed optimum algorithm is practical for use.

中文翻译：

---

异构多核系统的分析过程调度优化

在本文中，我们针对日益流行的异构多核 (HEMC) 系统类型提出了第一个最佳进程调度算法，该系统将高性能大核和节能小核与相同的指令集架构 (ISA) 相结合。现有的算法都是基于启发式的，众所周知的 IPC 驱动方法本质上试图在大内核上调度高缩放因子进程。我们的分析表明，对于最佳解决方案，考虑将长时间运行的进程放置在大内核上也很重要。SPEC 2006 案例在各种大小核组合上的测试表明，就总工作负载完成时间而言，我们提出的最佳方法比 IPC 驱动的启发式方法快 34%。我们算法的复杂度是 O(NlogN)，其中 N 是进程数。所以，