摘要
In most priority scheduling algorithms, the num- ber of priority levels is assumed to be unlimited. However, if a task set requires more priority levels than the system can support, several jobs must in practice be assigned the same priority level. To solve this problem, a novel group priority earliest deadline first （GPEDF） scheduling algorithm is pre- sented. In this algorithm, a schedulability test is given to form a job group, in which the jobs can arbitrarily change their or- der without reducing the schedulability. We consider jobs in the group having the same priority level and use shortest job first （SJF） to schedule the jobs in the group to improve the performance of the system. Compared with earliest deadline first （EDF）, best effort （BE）, and group-EDF （gEDF）, simu- lation results show that the new algorithm exhibits the least switching, the shortest average response time, and the fewest required priority levels. It also has a higher success ratio than both EDF and gEDF.
In most priority scheduling algorithms, the num- ber of priority levels is assumed to be unlimited. However, if a task set requires more priority levels than the system can support, several jobs must in practice be assigned the same priority level. To solve this problem, a novel group priority earliest deadline first （GPEDF） scheduling algorithm is pre- sented. In this algorithm, a schedulability test is given to form a job group, in which the jobs can arbitrarily change their or- der without reducing the schedulability. We consider jobs in the group having the same priority level and use shortest job first （SJF） to schedule the jobs in the group to improve the performance of the system. Compared with earliest deadline first （EDF）, best effort （BE）, and group-EDF （gEDF）, simu- lation results show that the new algorithm exhibits the least switching, the shortest average response time, and the fewest required priority levels. It also has a higher success ratio than both EDF and gEDF.
