期刊文献+

基于异构多核处理器的静态任务调度研究 被引量:7

Research on static task scheduling based on heterogeneous multi-core processors
下载PDF
导出
摘要 针对现存任务调度算法优先级选取过于单一、冗余任务处理较晚的问题,提出一种基于加权优先级的任务调度算法——WPTS算法。该算法综合考虑任务3个属性的加权值以决定任务被处理的先后次序,从而克服了任务选取时的单一性问题。在将任务分配到处理器的过程中,保证任务优先调度到完成时间最早的处理器上。同时,引入冗余任务处理过程,及时消除冗余任务,达到对处理器空闲时间段进行有效回收、减少处理器调度长度的效果。性能对比实验表明,WPTS算法较CPFD算法、HCPFD算法和HDEFT算法能取得更好的性能。 Aiming at the problems that singleness of priority selection and later dispose of redundant task existed in, a task scheduling algorithm based on the weighted priority named WPTS is proposed. To overcome the shortcomings of the singleness, this new algorithm takes the method of adding weighted value of the three task properties value to determine the priority of the tasks to be handled. In the phase of mapping the tasks to the processors, the task will be scheduled to the processor with the minimum execution time. Meanwhile, a redundant task elimination process is introduced to make full use of idle processors and reduce the schedule length as well as eliminate the redundant tasks timely. In the phase of mapping the task to the processors, make sure that schedule tasks to the processor which can minimum the completion time, the comparison experiments show that WPTS algorithm can achieve better performance than CPFD, HCPFD and HDEFT algorithms.
出处 《计算机工程与设计》 CSCD 北大核心 2013年第1期178-184,共7页 Computer Engineering and Design
基金 国家自然科学基金项目(61003036 60873138) 黑龙江省自然科学基金项目(F201124) 黑龙江省教育厅科学技术研究基金项目(12513048)
关键词 任务调度 冗余任务 加权优先级 任务属性 空闲时间段 task schedule redundant task weighted priority task properties idle time slot
  • 相关文献

参考文献8

  • 1Ahmad Ishfaq,Ranka Sanjay,Khan Samee Ullah. Using game theory for scheduling tasks on multi-core processors for simultaneous optimization of performance and energy[A].2008.2645-2650.
  • 2Laura De Giusti,Emilio Luque,Franco Chichizola. AMTHA:An algorithm for automatically mapping tasks to processors in heterogeneous multiprocessor architectures[A].2009.481-485.
  • 3Mohammad I Daoud,Nawwaf Kharma. A high performance algorithm for static task scheduling in heterogeneous distributed computing systems[J].Journal of Parallel and Distributed Computing,2008,(04):399-409.
  • 4Sah S K,Singh R S. Critical path based scheduling of multiple applications in heterogeneous distributed computing[A].2009.99-104.
  • 5Hagras T,Janecek. A high performance,low complexity algorithm for compile-time task scheduling in heterogeneous system[J].Parallel Computing,2005,(07):653-670.
  • 6张建军,宋业新,黄登斌.异构环境中Fork-Join任务图的调度算法[J].计算机工程与设计,2010,31(3):486-490. 被引量:2
  • 7Young Choon Lee,Albert Y Zomaya. A novel state transition method for metaheuristic-based scheduling in heterogeneous computing systems[J].IEEE Transactions on Parallel and Distributed Systems,2008,(09):1215-1223.
  • 8Matthieu Gallet,Loris Marchal. Efficient scheduling of task graph collections on heterogeneous resources[A].2009.1-11.

二级参考文献9

  • 1Sinnen O, Sousa L. On task scheduling accuracy: evaluation methodology and results[J].Journal of Supercomputing,2004,27 (2):177-194.
  • 2Boeres C,Rebello V E F.Towards optimal task scheduling for realistic machine models: Theory and practice[J]. International Journal of High Performance Applications,2003,17(2): 173-190.
  • 3Topcuoglu H,Hariri S,Wu M Y.Performance-effective and low-complexity task scheduling for heterogeneous computing [J]. IEEE Trans Parallel and Distributed Systems, 2002,13 (3): 260-274.
  • 4Darbha S,Agrawal D P.Optimal scheduling algorithm for distributed-memory machines[J].IEEE Trans Parallel and Distributed Systems,1998,9(1):87-94.
  • 5Park C I,Choe T Y.An optimal scheduling algorithm based on task duplication[J].IEEE Trans Computers,2002,51(4):444-448.
  • 6Oliver Sinnen, Leonel A Sousa. Communication contention in task scheduling[J].IEEE Trans Parallel and Distributed Systems, 2005,16(6):503-515.
  • 7杨斌,张建军,杨峰.调度Fork-Join任务图的贪心算法[J].计算机工程与设计,2008,29(15):3864-3866. 被引量:6
  • 8张建军,李庆华,瞿勇.基于任务复制的调度算法[J].计算机工程与设计,2009,30(8):1896-1899. 被引量:10
  • 9刘振英,方滨兴,姜 誉,张 毅,赵 宏,张 毅.一个调度Fork-Join任务图的新算法[J].软件学报,2002,13(4):693-697. 被引量:22

共引文献1

同被引文献54

  • 1兰舟,孙世新.基于动态关键任务的多处理器任务分配算法[J].计算机学报,2007,30(3):454-462. 被引量:14
  • 2Fortnow L.The status of the P versus NP problem[J].Communications of the Acm,2009,52 (9):78-86.
  • 3Moshe Y Vardi.On P,NP and computational complexity[J].Communications of the Acm,2010,53 (11):5-6.
  • 4Tang Xiaoyong,Li Kenli,Liao Guiping,et al.List scheduling with duplication for heterogeneous computing systems[J].J Parallel Distrib Comput,2010,70 (4):323-329.
  • 5Amit Agarwal,Padam Kumar.Economical duplication based task scheduling for heterogeneous and homogeneous computing system[C]//IEEE International Advance Computing Conference,2009:87-93.
  • 6Hassan Salamy,Ramanujam J.An effective solution to task scheduling and memory partitioning for multiprocessor systemon-chip[J].IEEE Tractions on Computer-Aided Design of Integrated and System,2012,31 (5):717-725.
  • 7Hosseinzadeh,Shahriar Shahhoseini.Earliest starting and finishing time duplication-based algorithm[J].Performance Evaluation of Computer & Telecommunication Systems,2009,41 (13):49-56.
  • 8陈锋,刘宗田,石振国,王莉.基于禁忌搜索算法的网格任务调度[J].计算机工程,2007,33(21):75-77. 被引量:8
  • 9Pranay C,Jeffrey E.Task scheduling in multiprocessing systems using duplication[J].Journal of Systems Architecture,2008,54(5):519-529.
  • 10Jin S,Schiavone G,Turgut D.A performance study of multiprocessor task scheduling algorithms[J].The Journal of Supercomputing,2008,43(1):77-97.

引证文献7

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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