期刊文献+

基于改进EDF的多核处理器混合任务调度算法 被引量:1

A hybrid task scheduling scheme for multicore processors based on improving the EDF algorithm
下载PDF
导出
摘要 为解决多核处理器系统中的实时任务调度问题,尤其是实时任务和非实时任务的混合调度问题,在对最早截止时间优先(EDF)算法进行改进的基础上,提出多核处理器混合任务调度算法——EDF.segment算法。EDF—segment算法可以整理调度混合任务时出现的碎片,并通过对碎片的迁移、合并提高处理器的利用率,从而提高系统处理混合任务的性能。通过EDF.segment算法不但可以解决混合任务的调度问题,还可以避免使用EDF算法时造成的多核处理器利用率下降,在保证实时任务处理延迟的前提下提升多核处理器的利用率。经过理论推导和实验分析证明,EDF—segment算法可以有效地应用于多核处理器系统中。 In order to schedule the real-time tasks in muhicore processor systems, especially to handle the hybrid tasks composed of real-time tasks and non-real-time tasks, this paper presents a hybrid task scheduling algorithm based on the improvement of the earliest deadline first (EDF) algorithm, called the EDF-segment algorithm. The EDF- segment algorithm can arrange the segments caused by hybrid task scheduling, and migrate and merge segments be- tween cores to enhance the processor utilization. The EDF-segment algorithm can not only solve the hybrid tasks scheduling, but also avoid the reduction of the multicore processor utilization by using the EDF algorithm, and en- hance the utilization with the guarantee that real-time tasks can be processed on time. Proved by theoretical and ex- perimental analysis, the EDF-segment algorithm can be effectively applied to multicore processor systems.
出处 《高技术通讯》 CAS CSCD 北大核心 2012年第3期231-239,共9页 Chinese High Technology Letters
基金 863计划(2008AA01A317)资助项目.
关键词 混合任务调度 最早截止时间优先(EDF)算法 时间片整理 多核处理器 hybrid task schedule, earliest deadline first (EDF)-based algorithm, time slice arrange, multicore processor
  • 相关文献

参考文献16

  • 1Baruah S K, Goossens J. Rate-monotonic scheduling on uniform multiprocessors. IEEE Transactions on Computers, 2003, 52(7):966-970.
  • 2Andersson B, Baruah S, Jonsson J. Static-priority scheduling on multiprocessors. In: Proceedings of the 22nd IEEE International Conference on Real-Time Systems Symposium, London, England, 2001. 193-202.
  • 3Chetto H, Chetto M. Some results of the earliest deadline scheduling algorithm. Software Engineering, IEEE Transactions on, 1989,15 (10) : 1261-1269.
  • 4Lee L T, Chang H Y, Chao S W. A hybrid task scheduling for multi-Core platform. In: Proceedings of the 2nd International Conference on Future Generation Communication and Networking Symposia, Sanya, China, 2008.40-45.
  • 5Calandrino J M, Anderson J H, Baumberger D P. A hybrid real-time scheduling approach for large-scale multicore platforms. In: Proceedings of the 19th Euromicro Conference on Real-Time Systems, Pisa, Italy, 2007. 247-258.
  • 6Anderson J H, Calandrino J M. Parallel task scheduling on multicore platforms. In: Proceedings of the 16th ACM Conference on Special Interest Group on Embedded Systems,New York, USA, 2006. 1-6.
  • 7Baruah S, Funk S, Goossens J. Robustness resuhs concerning EDF scheduling upon uniform multiprocessors. IEEE Transactions on Computers, 2003, 52 ( 9 ) : 1185- 1195.
  • 8Devi U M C, Anderson J H. Tardiness bounds under global EDF scheduling on a muhiprocessor. In: Proceedings of the 26th IEEE International Conference on Real- Time Systems Symposium, Miami, USA, 2005. 350-341.
  • 9Valente P, Lipari G. An upper bound to the lateness of soft real-time tasks scheduled by EDF on muhiprocessors. In: Proceedings of the 26th IEEE International Conference on Real-Time Systems Symposium, Miami, USA, 2005. 311-320.
  • 10Baruah S K, Cohen N K, Plaxton C G, et al. Proportionate progress: A notion of fairness in resource allocation. Algorithmlca, 1996, 15(6):600-625.

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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