一个调度Fork-Join任务图的最优算法
作者:
基金项目:

Supported by the National Natural Science Foundation of China under Grant No60273075 (国家自然科学基金)

  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [11]
  • |
  • 相似文献 [20]
  • |
  • 引证文献
  • | |
  • 文章评论
    摘要:

    Fork-Join任务图是一种并行处理的基本结构.虽然许多算法在任务满足某些条件时能产生最优调度,但往往没有考虑节省处理器个数和减少任务集的总完成时间,从而降低算法的加速比和效率.因此,提出一种基于任务复制的平衡调度算法,其时间复杂度为O(vq+vlogv),v和q分别表示任务集中任务的个数和使用的处理器个数.通过分析已用处理器的负载和空闲时间段,把任务尽量分配到已用的处理器上以均衡负载,从而提高其利用率.实验结果表明,该算法的加速比和总体效率优于其他算法.因此,该算法对于高性能应用程序的调度是一个较好的选择.

    Abstract:

    The Fork-Join structure is one of the basic modeling structures for parallel processing. Although some algorithms are able to find an optimal schedule under certain conditions, they ignore to economize processors and minimize the total completion time. This paper presents a Task Duplication based Balance Scheduling(TDBS)algorithm which can generate an optimal schedule for fork-join task graph with a complexity of O(vq+vlogv), where v and q are the number of tasks and processors respectively. By considering workload and idle time slots of the used processors, TDBS algorithm tries to assign tasks to scheduled processors and maximize their utilization. Simulation results show that TDBS algorithm has better speedup and efficiency than other compared algorithms. Therefore,TDBS algorithm is a viable option for practical high performance applications.

    参考文献
    [1]Yang T, Gerasoulis A. DSC: Scheduling parallel tasks on an unbounded number of processors. IEEE Trans. on Parallel and Distributed Systems, 1994,5(9):951-967.
    [2]Kwok YK, Ahmad I. Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors, IEEE Trans. on Parallel and Distributed Systems, 1996,7(5):506-521.
    [3]Palis MA, Jing-Chiou Liou, Wei DSL. Task clustering and scheduling for distributed memory parallel architecture. IEEE Trans. on Parallel and Distributed Systems, 1996,7(1):46-55.
    [4]Ahmad I, Kwok YK. On exploiting task duplication in parallel program scheduling. IEEE Trans. on Parallel and Distributed Systems, 1998,9(9):872-891.
    [5]Darbha S, Agrawal DP. Optimal scheduling algorithm for distributed-memory machines. IEEE Trans. on Parallel and Distributed Systems, 1998,9(1):87-94.
    [6]Chan-Ik Park, Tae-Young Choe. An optimal scheduling algorithm based on task duplication. IEEE Trans. on Computers, 2002,51 (4):444-448.
    [7]Liu ZY, Fang BX, Jiang Y, Zhang Y, Zhao H. A new algorithm for scheduling fork-join task graph. Journal of Software,2002,13(4):693-696 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/13/693.pdf
    [8]Liu ZY, Fang BX, Zhang Y. TSA-OT: An algorithm scheduling an out-tree DAG. Chinese Journal of Computers, 2001,24(4):390-394 (in Chinese with English abstract).
    [9]Andrei Radulescu, Arjan JC, van Gemund. Low-Cost task scheduling for distributed-memory machines. IEEE Trans. on Parallel and Distributed Systems, 2002,13(6):648-658.
    [10]刘振英,方滨兴,姜誉,张毅,赵宏.一个调度Fork-Join任务图的新算法.软件学报,2002,13(4):693-697.http://www.jos.org.cn/1000-9825/13/693.pdf
    [11]刘振英,方滨兴,张毅.TSA-OT:一个调度Out-Tree任务图的算法.计算机学报,2003,14(2):190-196.
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

李庆华,阮幼林,刘干,蒋盛益,杨世达.一个调度Fork-Join任务图的最优算法.软件学报,2005,16(5):684-690

复制
分享
文章指标
  • 点击次数:3537
  • 下载次数: 4954
  • HTML阅读次数: 0
  • 引用次数: 0
历史
  • 收稿日期:2003-07-07
  • 最后修改日期:2004-07-21
文章二维码
您是第19829859位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号