IRIS Task Scheduling Algorithm Based on Task Selection Policies


The KIPS Transactions:PartA, Vol. 10, No. 3, pp. 181-188, Aug. 2003
10.3745/KIPSTA.2003.10.3.181,   PDF Download:

Abstract

We propose a heuristic on-line scheduling algorithm for the IRIS (Increasing Reward with Increasing Service) tasks, which has low computation complexity and produces total reward approximated to that of previous on-line optimal algorithms. The previous on-line optimal algorithms for IRIS tasks perform scheduling on all tasks in a system to maximize total reward. Therefore, the complexities of these algorithms are too high to apply them to practical systems handling many tasks. The proposed algorithm doesn´t perform scheduling on all tasks in a system, but on (constant)´s tasks selected by a predefined task selection policy. The proposed algorithm is based on task selection policies that define how to select tasks to be scheduled. We suggest two simple and intuitive selection policies and a generalized selection policy that integrates previous two selection policies. By narrowing down scheduling scope to only´s selected tasks, the computation complexity of proposed algorithm can be reduced to. However, simulation results for various cases show that it is closed to on the average.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. J. Hong, C. G. Hui, J. G. Hyeon, "IRIS Task Scheduling Algorithm Based on Task Selection Policies," The KIPS Transactions:PartA, vol. 10, no. 3, pp. 181-188, 2003. DOI: 10.3745/KIPSTA.2003.10.3.181.

[ACM Style]
Sim Jae Hong, Choe Gyeong Hui, and Jeong Gi Hyeon. 2003. IRIS Task Scheduling Algorithm Based on Task Selection Policies. The KIPS Transactions:PartA, 10, 3, (2003), 181-188. DOI: 10.3745/KIPSTA.2003.10.3.181.