首页> 外文会议>IEEE International Conference on Parallel and Distributed Systems >ISAECC: An Improved Scheduling Approach for Energy Consumption Constrained Parallel Applications on Heterogeneous Distributed Systems
【24h】

ISAECC: An Improved Scheduling Approach for Energy Consumption Constrained Parallel Applications on Heterogeneous Distributed Systems

机译:ISAECC:异构分布式系统上能耗受限的并行应用程序的改进调度方法

获取原文

摘要

Power-aware task scheduling on processors has been a hot topic. In this paper, we study the problem of minimizing the schedule length for energy consumption constrained parallel applications on heterogeneous distributed systems. Previous work (solving this problem) adopts a policy that preassigns the minimum energy consumption for each unassigned task. Nevertheless, our analysis reveals that such a preassignment policy could be unfair, and it may not achieve an optimistic schedule length. Motivated by this, we propose a new task scheduling algorithm that suggests a weight-based mechanism to preassign energy consumption for unassigned tasks. We theoretically prove that our preassignment mechanism can guarantee the energy consumption constraint. Also, we have conducted extensive experiments based on two real parallel applications. The results consistently demonstrate that, compared to state-of-the-art algorithms, our approach can achieve smaller schedule length while satisfying the energy consumption constraint.
机译:处理器上具有功耗意识的任务调度一直是热门话题。在本文中,我们研究了在异构分布式系统上将能耗受限的并行应用程序的调度长度最小化的问题。先前的工作(解决此问题)采用的策略是为每个未分配的任务预先分配最低能耗。然而,我们的分析表明,这样的预分配政策可能是不公平的,并且可能无法达到乐观的时间表长度。因此,我们提出了一种新的任务调度算法,该算法提出了一种基于权重的机制来为未分配的任务预先分配能耗。我们从理论上证明了我们的预分配机制可以保证能耗约束。此外,我们基于两个实际的并行应用程序进行了广泛的实验。结果一致表明,与最新算法相比,我们的方法可以在满足能源消耗约束的同时实现更小的调度长度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号