期刊文献+

基于异构CMP的静态任务调度研究 被引量:1

Research on Static Task Scheduling Based on Heterogeneous Chip Multi-processor
下载PDF
导出
摘要 现有任务调度算法在选取任务优先级参数时仅仅考虑单一属性,且没有及时处理冗余任务,针对这一问题,提出一种异构CMP中列表与复制优化任务调度算法-HLDOTS算法.该算法首先对任务图中某些特殊的任务进行优化;综合考虑任务的多个属性来为任务分配优先级,构造调度列表;在任务分配阶段,采用基于插入的策略和任务复制技术将当前任务分配到最早执行完成该任务的处理器上;并逐层对调度结果中产生的冗余任务进行处理,将任务分配与冗余任务处理交替进行,避免了冗余任务对处理器资源的浪费,提高了处理器的资源利用率和任务调度效率.采用随机生成图进行模拟实验,实验结果表明,HLDOTS算法较HEFT算法、CPOP算法和HCPFD算法取得了更好的调度性能. Aiming at the issue that the singleness attribute of task priority parameter selection and redundancy task handled untimely in the existing task scheduling algorithms, this paper proposes a heterogeneous multi-core list and duplication optimization task scheduling algorithm named HLDOTS. This algorithm optimizes certain specific tasks in task graph firstly; Considering multiple attributes of task assigns priorities to the tasks, which builds scheduling list; In the task assignment phase, using a strategy insertion based and task duplication technique assign the current task to processor, which has the earliest execution completion time of task; The algorithm processes redundancy tasks caused by the scheduling result layer by layer, assigning tasks alternates with processing redundancy task, which avoids a waste of processor resources caused by redundancy tasks, this improves processor resource utilization and the efficiency of task scheduling. The simulation experiment uses randomly generated graphs, the experimental result shows that HLDOTS algorithm can achieve better performance than HEFT,CPOP and HCPFD algorithms.
出处 《小型微型计算机系统》 CSCD 北大核心 2014年第12期2770-2774,共5页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(61003036)资助 黑龙江省自然科学基金项目(F201124)资助 黑龙江省教育厅科学技术研究基金项目(12513048)资助 中央高校基本科研业务费专项资金项目(HEUCF100607)资助
关键词 任务调度 列表 插入 任务复制 冗余任务 task scheduling list insertion task duplication redundancy task
  • 相关文献

参考文献2

二级参考文献16

  • 1[1]Yen TY, Wolf W. Hardware/Software Co-Synthesis of Distributed Embedded System. Netherlands: Kluwer Academic Publishers, 1996. 1~57.
  • 2[2]Garey MR, Johnson DS. Computers and Intractability-A Guide to the Theory of NP-Completeness. New York: W.H. Freeman and Co., 1979.
  • 3[3]Kwok YK, Ahmad I. Dynamic critical-path scheduling: An effective technique for allocation task graphs to multiprocessors. IEEE Trans. on Parallel and Distributed Systems, 1996,7(5):506~521.
  • 4[4]Hou ESH, Ansari N, Ren H. A genetic algorithm for multiprocessor scheduling. IEEE Trans. on Parallel and Distributed Systems, 1994,5(2):113~120.
  • 5[5]Wu M, Gajski D. Hypertool: A programming aid for message passing systems. IEEE Trans. on Parallel and Distributed Systems, 1990,1(3):330~343.
  • 6[6]Sih GC, Lee EA. A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Trans. on Parallel and Distributed Systems, 1993,4(2):175~186.
  • 7[7]EI-Rewini H, Lewis TG. Scheduling parallel program tasks onto arbitrary target machines. Journal of Parallel and Distributed Computing, 1990,9(2):138~153.
  • 8[8]Wu MY, Shu W, Gu J. Efficient local search for DAG scheduling. IEEE Trans. on Parallel and Distributed Systems, 2001,12(6): 617~627.
  • 9[9]Topcuoglu H, Hariri S, Wu MY. Performance-Effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. on Parallel and Distributed Systems, 2002,13(3):260~274.
  • 10Kwok Y K,Ahmad I.Benchmarking the task graph scheduling algorithms[J].Parallel Processing Symposium,1998,531-537.

共引文献18

同被引文献4

引证文献1

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部