The task scheduling is a major research area in heterogeneous multi-core computing systems, in which managing complex tasks and achieving optimal efficiency presents challenges. Thus we propose a novel load balanced scheduling method based on multi-modal parallelism (Multi-modal Parallel Balanced Schedule, MPBS) by constructing a multi-modal parallel task computing model. The method integrates the improved greedy algorithm and Pierre Dellacherie algorithm to achieve dynamic scheduling of multi-modal tasks, and it is identified by iterative optimization search and fine-grained search compensation, which fully considers the utilization and load distribution for computing resources. Finally, the proposed method is implemented using hardware design and compared with several classic scheduling algorithms with respect to multiple performance metrics. The experimental results show that MPBS can obtain 35.4% decrease of makespan and 1.55x performance speedup, as well as 42.5% of load balancing rate reduction.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Multi-modal Parallelism Scheduling for Heterogeneous Multicore Computing Systems

  • Lei Gao,
  • Jingfei Jiang,
  • Jinwei Xu

摘要

The task scheduling is a major research area in heterogeneous multi-core computing systems, in which managing complex tasks and achieving optimal efficiency presents challenges. Thus we propose a novel load balanced scheduling method based on multi-modal parallelism (Multi-modal Parallel Balanced Schedule, MPBS) by constructing a multi-modal parallel task computing model. The method integrates the improved greedy algorithm and Pierre Dellacherie algorithm to achieve dynamic scheduling of multi-modal tasks, and it is identified by iterative optimization search and fine-grained search compensation, which fully considers the utilization and load distribution for computing resources. Finally, the proposed method is implemented using hardware design and compared with several classic scheduling algorithms with respect to multiple performance metrics. The experimental results show that MPBS can obtain 35.4% decrease of makespan and 1.55x performance speedup, as well as 42.5% of load balancing rate reduction.