一种能耗约束的多核系统任务调度算法

A Energy-Constraint Task Scheduling Algorithm on Multi-Processor System

  • 摘要: 不同的任务调度算法将任务分配在不同的处理单元,会产生不同的能耗。在基于片上网络的多核系统中,将任务分摊到所有处理器核能提高系统利用率,但导致大量的簇间通信,增加数据传输能耗。本文在对系统能耗进行建模的基础上,提出一种能耗约束的任务调度算法。该算法结合任务间依赖关系,动态计算任务分配时产生通信开销最小的簇和系统利用率最大的簇,通过计算在相应簇上产生的系统能耗,选择产生系统能耗小的分配方案以平衡系统利用率和簇间通信开销。仿真实验结果证明,算法在减少了簇间通信开销并提高系统利用率的同时,降低了系统能耗。

     

    Abstract: Different task scheduling algorithms assign tasks to different processors and result in different energy consumptions. In NoC-based (network on chip-based) multi-processor systems, distributing tasks to all processor elements could improve system utilization, but causing a large amount of inter-cluster communication and increasing data transmission energy consumption. Based on modeling the energy consumption model, this paper proposes an energy constraints task scheduling algorithm. Combining with the dependencies between tasks, the proposed algorithm dynamically calculates the cluster with minimal communication overhead and the cluster with maximal system utilization. Though calculating the energy consumption of corresponding clusters, the proposed algorithm chooses the plan which generates smaller energy consumption in order to balance system utilization and inter-cluster communication overhead. Simulation results show that the proposed algorithm can reduce the energy consumption, lower the inter-cluster communication overhead and increase the system utilization.

     

/

返回文章
返回