Static Priority Assignment Algorithm to Reduce Output Jitter of Real-time Tasks
Jianghong Han · Jisuanji gongcheng · 2012
Current deadline assignment schemes which adjust relative deadlines to reduce the output jitter of periodic real-time tasks are all under EDF(Earliest Deadline First) scheduling algorithm.In this paper,a static priority assignment problem to minimize the total output jitter of a set of real-time tasks is proposed.A heuristics algorithm is presented to solve this problem.It assigns the initial priority to each task according to RM(Rate Monotonic) algorithm,and adjusts the priority of each task one by one in terms of minimizing the sum of local output jitter,until a near optimal solution to the static priority assignment problem is found.Simulation results show the advantages of the algorithm in terms of reducing the total output jitter of a set of tasks and computing complexity.