A Dynamic-Priority-Based Real-Time Scheduling Algorithm for Mixed Task Set

Hongyu Yang · Journal of Sichuan University · 2006

Aim at complicated real-time model,the paper proposes a new Dynamic-Priority-Based real-time scheduling algorithm for mixed task set.The experimental results show that,the algorithm can improve the probability of satisfaction of deadline for hard deadline tasks;and it also improves the proportion of accomplish of firm deadline.

Read the paper · More papers on PaperTik