Low complexity dynamic scheduling algorithm for real-time tasks

作     者：Jung, G Kim, T Park, S Choi, K 

作者机构：Ajou Univ Sch EE Suwon 442749 South Korea ETRI Taejon 305350 South Korea Ajou Univ Sch IE & CE Suwon 442749 South Korea 

出 版 物：《ELECTRONICS LETTERS》 (Electron. Lett.)

年 卷 期：1999年第35卷第24期

页      面：2106-2108页

核心收录：

学科分类：0808[工学-电气工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 

主　　题：real-time tasks processor scheduling average complexity maximum derivatives task arrival characteristics online tasks dynamic scheduling algorithm reward functions Computational complexity heuristic algorithm real-time systems computational complexity 

摘      要：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.