Title :
Low complexity dynamic scheduling algorithm for real-time tasks
Author :
Jung, G. ; Kim, T. ; Park, S. ; Choi, K.
Author_Institution :
Dept. of Electron. Eng., Ajou Univ., Suwon, South Korea
fDate :
11/25/1999 12:00:00 AM
Abstract :
It is shown that the problem of maximising the total reward of online tasks can be solved by finding the minimum of the maximum derivatives of the reward functions. Based on the modified approach and a close observation of task arrival characteristics, a heuristic algorithm with average complexity close to O(N) is presented
Keywords :
computational complexity; processor scheduling; real-time systems; average complexity; dynamic scheduling algorithm; heuristic algorithm; maximum derivatives; online tasks; real-time tasks; reward functions; task arrival characteristics;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19991417
