期刊文献+

异构多处理器系统的混合任务调度算法 被引量:2

A Hybrid Task Scheduling Algorithm for Heterogeneous Multiprocessor System
在线阅读 下载PDF
导出
摘要 针对实时异构系统的任务调度问题,提出了一种异构多处理器系统的混合实时任务调度算法。该算法采用带有非周期服务器的EDF(Earliest Deadline First)算法来调度单处理器上的任务集,可充分利用处理器的计算带宽。采用启发式搜索算法来进行任务的分配,以最大剩余计算带宽为搜索指标,可确保各处理器的负载尽量平衡。同时,对软实时任务引入QoS(Quality of Service)降级机制,可提高任务集的整体调度成功率。最后,对算法进行了仿真实验,仿真结果证明了算法的有效性。 Aiming at the task scheduling of real-time heterogeneous system, an algorithm for hybrid real-time task scheduling of heterogeneous multiprocessor system was proposed. For scheduling tasks on uniprocessor, Earliest Deadline First (EDF) algorithm with aperiodic server was adopted because it can make full use of computing bandwidth of the processor. The heuristic search algorithm was used for task assignment by taking the maximum remained computing bandwidth as a standard for searching when selecting a processor, thus could equilibrate the load of each processor. Further, the method of degrading QoS was introduced for soft real-time tasks because it can improve scheduling success ratio. At last, simulation experiment was implemented and the result proved the validity of the algorithm.
出处 《电光与控制》 北大核心 2011年第12期39-43,共5页 Electronics Optics & Control
基金 国家"八六三"计划基金资助项目(2007AAJ210)
关键词 多处理器系统 任务调度 异构系统 混合实时任务 muhiprocessor system task scheduling heterogeneous system hybrid real-time task
  • 相关文献

参考文献11

二级参考文献66

  • 1王永吉,陈秋萍.单调速率及其扩展算法的可调度性判定[J].软件学报,2004,15(6):799-814. 被引量:50
  • 2陈彩,熊华钢,罗志强.多路数据总线通讯传输方案优化[J].电光与控制,1996,3(3):31-36. 被引量:4
  • 3赵明,赵海,张文波,孙佩刚.一个基于RM的弱硬实时调度算法[J].东北大学学报(自然科学版),2006,27(7):743-746. 被引量:3
  • 4Cheng M K. Real time systems: scheduling, analysis, and verification[M]. New York: a John Wiley & Sons, 2002:1 - 60.
  • 5Tan Y D, Mooney V. Timing analysis for preemptive multitasking real-time systems with caehes [ J ]. ACM Transactions on Embedded Computing Systems, 2007, 6 (1):7-10.
  • 6Ramaprasad H, Mudler F. Bounding preemption delay within data cache reference patterns for real-time tasks[C]// Proceedings of the 12th IEEE Real Time and Embedded Technology Symposium. New York: IEEE, 2006:71 - 80.
  • 7Ramaprasad H, Mueller F. Tightening the bounds on feasible preemption points [C]//Proceedings of the 27th IEEE International Real-Time Systems Symposium. LoS Alamitos: IEEE Computer Society, 2006 : 212 - 222.
  • 8Liu C L, Layland J W. Scheduling algorithms for multiprogranmling in a hard-real time environment [ J ]. Journal of the ACM, 1973,20 ( 1 ) : 46 - 61.
  • 9Lehoczky J P. Fixed priority scheduling of periodic task .sets with arbitrary deadlines [C]//Proceedings of the 1 hh Real- Time Systems Symposium. Los alamitos: IEEE Computer Society, 1990:201 - 209.
  • 10Hoczky J P, Sha L, Strosnider J. A periodic scheduling in a hard real-time environment [ C ]//Proceedings of 8th IEEE Rea-Time System Symposium. San Franeisco: IEEE Computer Society, 1987:261 - 270.

共引文献76

同被引文献20

引证文献2

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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