计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (33): 9-11.

• 博士论坛 • 上一篇    下一篇

一个新的基于通信竞争的任务调度算法

杨 斌1,张建军2   

  1. 1.海军工程大学 管理工程系,武汉 430033
    2.海军工程大学 理学院,武汉 430033
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-11-21 发布日期:2007-11-21
  • 通讯作者: 杨 斌

New scheduling algorithm with communication contention

YANG Bin1,ZHANG Jian-jun2   

  1. 1.Department of Management,Naval University of Engineering,Wuhan 430033,China
    2.College of Science,Naval University of Engineering,Wuhan 430033,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-11-21 Published:2007-11-21
  • Contact: YANG Bin

摘要: 任务调度是并行处理的一个非常关键的方面。目前的调度算法大多假定处理器完全互连、可以并行接收数据,而没有考虑实际应用中通信链路的竞争及延迟,进而导致调度算法在具体应用中效率较低。论文研究异构计算环境下具有依赖关系任务的边调度问题,结合传统任务调度问题中的有效策略,提出一种新的调度算法,该算法通过串行化通信边使通信竞争集成化。实验结果表明,与各种经典调度方案相比,该算法显著地改善了精确性和效率。

关键词: 通信竞争, 任务调度, 串行化

Abstract: Task scheduling is an essential aspect of parallel processing.However,many previous works assume fully connected processors and concurrent communication,while ignoring the contention and delay on data links in real applications,which leads to low efficiency.This paper focuses on the issue of edge scheduling for dependent tasks in heterogeneous environment.Combining with classically efficient heuristics,this paper proposes a new scheduling algorithm that integrates communication contention by serializing the communications edges,which produces significantly more accurate and efficient schedules than classic schedule schemes in experiments.

Key words: communication contention, task scheduling, serializing