Browse > Article

Performance Enhancement of On-Line Scheduling Algorithm for IRIS Real-Time Tasks using Partial Solution  

심재홍 (조선대학교 인터넷스프트웨어공학부)
최경희 (아주대학교 정보통신전문대학원)
정기현 (아주대학교 전자공학부)
Abstract
In this paper, we propose an on-line scheduling algorithm with the goal of maximizing the total reward of IRIS (Increasing Reward with Increasing Service) real-time tasks that have reward functions and arrive dynamically into the system. We focus on enhancing the performance of scheduling algorithm, which W.: based on the following two main ideas. First, we show that the problem to maximize the total reward of dynamic tasks can also be solved by the problem to find minimum of maximum derivatives of reward functions. Secondly, we observed that only a few of scheduled tasks are serviced until a new task arrives, and the rest tasks are rescheduled with the new task. Based on our observation, the Proposed algorithm doesn't schedules all tasks in the system at every scheduling print, but a part of tasks. The performance of the proposed algorithm is verified through the simulations for various cases. The simulation result showed that the computational complexity of proposed algorithm is$O(N_2)$ in the worst case which is equal to those of the previous algorithms, but close to O(N) on the average.
Keywords
real-time system; on-line scheduling; maximizing total reward;
Citations & Related Records
연도 인용수 순위
  • Reference
1 E. Chang and A. Zakhor, 'Scalable Video Coding Using 3-D Subband Velocity Coding and Multi-Rate Quantization,' Proc. IEEE Int'l Conf. Acoustic, Speech, Signal Processing, Minneapolis, July, 1993
2 J.W.S. Liu, Real-Time Systems, Prentice-Hall, 2000
3 J. Grass and S. Zilberstein, 'A Value-Driven System for Autonomous Information Gathering,' J. Intelligent Information Systems, Vol. 14, pp. 5-27, March 2000   DOI   ScienceOn
4 G. Jung, K. Yim, J. Jung, J. Shin, K. Choi, D. Kim, and J. Shim, 'An Imprecise DCT Computation Model for Real-Time Applications,' Multimedia Technology and Applications, edited by V. Chow, pp.153-161, Springer, Dec. 1996
5 B. Hayes-Roth, 'Architectural Foundations for Real-Time Performance in Intelligent Agents,' J. Real-Time Systems, Vol. 2, No. 1, pp. 99-125, 1990   DOI
6 S.V. Vrbsky and J.W.S. Liu, 'APPROXIMATE - A Query Processor that Produces Monotonically Improving Approximate Answers,' IEEE Trans. Knowledge and Data Eng., Vol. 5, No.6, pp. 1056-1068, Dec. 1993   DOI   ScienceOn
7 R.E. Korf, 'Real-Time Heuristic Search,' Artificial Intelligence, Vol. 42, No. 2, pp. 189-212, 1990   DOI   ScienceOn
8 E.J. Horvitz, 'Reasoning under Varying and Uncertain Resource Constraints,' Proc. 7th Nat'l Conf. Artificial Intelligence (AAAI-88), pp. 111-116, St. Paul, Minn., Aug. 1988
9 M. Boddy and T. Dean, 'Deliberation Scheduling for Problem Solving in Time-Constrained Environments,' Artificial Intelligence, Vol. 67, No. 2, pp. 245-285, June 1994   DOI   ScienceOn
10 J.K. Dey, J.F. Kurose, and D. Towsley, 'On-line Scheduling Policies for a Class of IRIS (Increasing Reward with Increasing Service) Real-Time Tasks,' IEEE Trans. Computers, Vol. 45, No. 7, 802-813, July 1996   DOI   ScienceOn
11 J.K. Dey, J.F. Kurose, D. Towsley, C.M. Krishna and M. Girkar, 'Efficient On-Line Processor Scheduling for a Class of IRIS (Increasing Reward with Increasing Service) Real-Time Tasks,' Proc. ACM Sigmetrics Conf. Measurement and Modeling of Computer Systems, pp. 217-228, Santa Clara, Calif., May 1993   DOI
12 K. Choi and G. Jung, 'Comment on On-line Scheduling Policies for a Class of IRIS Real-Time Tasks,' IEEE Trans. Computers, Vol. 50, No. 5, pp. 526-528, May 2001   DOI   ScienceOn
13 H. Aydin, R. Melhem, D. Mosse, and P. Mejia-Alvarez, 'Optimal Reward-based Scheduling for Periodic Real-Time Tasks,' IEEE Trans. Computers, Vol. 50, No. 2, pp. 111-130, Feb. 2001   DOI   ScienceOn
14 C.L. Liu and J.W. Layland, 'Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,' J. ACM, Vol. 20, No. 1, pp. 46-61, Jan. 1973   DOI
15 J.W.S. Liu, K.J. Lin, W.K. Shih, A.C.S. Yu., J.Y. Chung, and W. Zhao, 'Algorithms for Scheduling Imprecise Computations,' IEEE Computer, Vol. 24, No. 5, pp. 58-68, May 1991   DOI   ScienceOn