将非均匀松弛度应用于用于非周期性任务的EDF以提高多核平台上的任务利用率
Application of non-uniform laxity to EDF for aperiodic tasks to improve task utilisation on multicore platforms
摘要:
本文提出了一种新的调度器应用的概念,非均匀松弛的最早期限优先(EDF)的非周期性任务的方法。此调度程序提高了任务利用率(执行时间/截止日期),并增加了正在调度的任务数量。松弛度是在任务错过其截止日期之前允许的空闲时间的度量,并且使用表达式(截止日期-(当前时间+执行时间))来计算。权重决定任务的优先级,并由表达式(量程片时间/分配时间)* 任务的总核心时间定义。量子切片时间是实际使用的时间,分配时间是调度器分配的时间,总核心时间是核心为执行任务的一个量子实际保留的时间。非均匀松弛度允许在其他任务的正常执行之前调度具有更高优先级的任务,并且通过将任务的权重乘以其松弛度来计算。本文提出的算法已被模拟Cheddar,实时的调度工具,也SESC,多核平台的架构模拟器,多达5000个随机任务集,多达5000个核心。与传统的EDF相比,该调度器将任务利用率提高了35%,被调度的任务数量提高了36%。
英文摘要:
This paper proposes a new scheduler applying the concept of non-uniform laxity to Earliest deadline first (EDF) approach for aperiodic tasks. This scheduler improves task utilisation (Execution time / deadline) and also increases the number of tasks that are being scheduled. Laxity is a measure of the spare time permitted for the task before it misses its deadline, and is computed using the expression (deadline - (current time + execution time)). Weight decides the priority of the task and is defined by the expression (quantum slice time / allocated time)*total core time for the task. Quantum slice time is the time actually used, allocated time is the time allocated by the scheduler, and total core time is the time actually reserved by the core for execution of one quantum of the task. Non-uniform laxity enables scheduling of tasks that have higher priority before the normal execution of other tasks and is computed by multiplying the weight of the task with its laxity. The algorithm presented in the paper has been simulated on Cheddar, a real time scheduling tool and also on SESC, an architectural simulator for multicore platforms, for upto 5000 random task sets, and upto 5000 cores. This scheduler improves task utilisation by 35% and the number of tasks being scheduled by 36%, compared to conventional EDF.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。