Man Uk Choi, Dae Man Han, Yong Wan Koo

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 7, No. 7, pp. 2229-2237, Jul. 2000
10.3745/KIPSTE.2000.7.7.2229,   PDF Download:

Abstract

This paper intends to improve the problems of the slack stealing algorithm scheduling for periodic tasks with fixed priority and aperiodic tasks which occur dynamically. The Slack stealing algorithm reduces unnecessary waiting time by making the service possible immediately when the slack stealing server gives suitable priority to aperiodic tasks according to the status of aperiodic tasks arrivals at runtime. But to performs the slack stealing, we must calculate execution time of periodic tasks till the point of random. And, execution time of periodic tasks is being repeatedly calculated every hours while the slack algorithm is applied. We show time complexity when is used as to O(n) if the number of tasks which is applied to the calculation is n. In this paper, due to stored in tables slack times and the execution times of the scheduled periodic tasks, the complexcity of aperiodic tasks which is occurring dynamically reduced to O() and improves the response times. we prove the algorithm proposed in this paper through the simulation.

Statistics
Cite this article