Heuristic algorithms for dynamic scheduling of moldable tasks in multicore embedded systems
Heuristic algorithms for dynamic scheduling of moldable tasks in multicore embedded systems
复制标题
DOI：
10.11591/ijres.v10.i3.pp157-167
复制
发表时间：
2021-11
期刊：
影响因子：
--
通讯作者：
Takuma Hikida;Hiroki Nishikawa;H. Tomiyama
中科院分区：
文献类型：
--
作者：
Takuma Hikida;Hiroki Nishikawa;H. Tomiyama
平行任务的动态调度是在多核心系统中实现高性能的有效技术之一。用于动态任务调度的大多数现有算法都假定任务在多个内核之一或固定数量的内核上运行。关于动态任务调度方法的现有研究已经在不同的实验环境和模型中评估了其方法。在本文中，动态任务调度方法是系统地重新排列和评估的。
Dynamic scheduling of parallel tasks is one of the efficient techniques to achieve high performance in multicore systems. Most existing algorithms for dynamic task scheduling assume that a task runs on one of the multiple cores or a fixed number of cores. Existing researches on dynamic task scheduling methods have evaluated their methods in different experimental environments and models. In this paper, the dynamic task scheduling methods are systematically rearranged and evaluated.