A real-time scheduling algorithm based on priority table

Among preemptive real-time uniprocessor scheduling algorithms, many researches, such as optimal and heuristic algorithms, considers only one task attribute and neglects also the variation of attributes. To understand the relations between task attributes and scheduling success ratio, we first define the sensitivity of scheduling success ratio to task attributes. Sensitivity means the intensity of variation of scheduling success ratio as task attributes varies. The paper analyzes the sensitivities of scheduling success ratio to arrival time, execution time, deadline and laxity respectively, which have close relations with scheduling. Based on the definition of sensitivity, we also define attributes' influence on scheduling success ratio, which is that the greater the influence, the higher the ratio. The essence of dynamic scheduling is a scheduling based on priority, with each dynamic algorithm matching a priority table, and vice versa. It is also much easier to infer the algorithm from the priority table, which can consider several task attributes. As priority table has various designs, it can correspond to a lot of algorithms, among which, many are inefficient. In order to deal with this kind of problem, we propose a new priority table design PTBM combining deadline and laxity based on the analysis of sensitivity and influence, which makes that a task with small deadline and large laxity has higher priority. We compare PTBM with EDF, LLF and PTD through simulation. The results verify the analysis of sensitivity and influence, and it also shows that PTBM outperforms on scheduling success ratio. It needs further exploration to design more efficient priority table by analyzing more task attributes' influence on scheduling success ratio, which includes criticalness, task type and so on.