Author(s)

W. Tarng & T.-H. Lin

Abstract

Modern process control systems are usually incorporated with high-speed computers to satisfy the requirements of real-time response and growing complexity. In such systems, the whole mission is divided into a number of tasks which are scheduled to meet their real-time constraints. In this paper, an adaptive scheduling algorithm based on current task queue length is proposed to handle the problem of transient overload in real-time processing systems due to the change of task characteristics. Our simulation result shows that the queue- length-based (QLB) algorithm can achieve better performance than traditional static scheduling algorithms. 1 Introduction The major difference between real-time systems and general-purpose computer s

Keywords