Real-time scheduling algorithm based on priority table.

Focused on dynamic scheduling of single-processor real-time system, this paper defined and analyzed the sensitivity and influence of task attributes including arrival time, execution time, deadline and laxity, then it proposed a scheduling algorithm PTBM based on priority table, which made that a task with small deadline and large laxity had higher priority. Compared with PTBM with EDF, LLF and PTD, simulated results verify CMRN of the sensitivity and influence, and show PTBM outperforming on scheduling success ratio. The proposed algorithm can be applied to dynamically schedule real-time tasks in realtime systems. [ABSTRACT FROM AUTHOR]