Task scheduling algorithm based on intelligent network disk storage system

被引：0
|
作者：
Zhao Y.-L. [1 ]
Liu M.-N. [1 ]
Wang W.-F. [1 ]
机构：
[1] School of Computer Science and Engineering, South China University of Technology, Guangzhou 510006, Guangdong
来源：
Huanan Ligong Daxue Xuebao/Journal of South China University of Technology (Natural Science) | 2010年 / 38卷 / 07期
关键词：
Controllable scheduling algorithm; Intelligent network disk storage system; Starvation phenomenon; Step chain;
D O I：
10.3969/j.issn.1000-565X.2010.07.001
中图分类号：
学科分类号：
摘要：
Although the existing scheduling algorithm of intelligent network disk (IND) storage system minimizes the weighted time cost of tasks, it may result in a starvation phenomenon because many tasks cannot be executed for a long time. In order to solve this problem, an controllable scheduling algorithm (CSA) is proposed, which divides the tasks into several step chains, computes the ρ factor of tasks according to the execution time and weight of step chains, and selects the unexecuted step chain according to both the ρ factor and the execution time of the tasks of ρ factor. Experimental results indicate that, as compared with the existing IND algorithm, the proposed CAS is of similar total weighted time cost, lower average turnaround time cost of tasks and completion time cost of short tasks, and that it effectively eliminates the starvation with balanced efficiency and fairness.
引用
收藏
页码：1 / 6
页数：5
相关论文
共 10 条
  • [1] Zhao Y.-L., Dai Z.-X., Wang Z.-G., Et al., Research on storage system architecture of the intelligent network disk (IND), Chinese Journal of Computers, 31, 5, pp. 858-866, (2008)
  • [2] Freund R.F., Cherrity M., Ambrosius S., Et al., Scheduling resource in Multi-user, heterogeneous, computing environments with SmartNet, Proceedings of Heterogeneous Computing Work-shop, pp. 184-199, (1998)
  • [3] Braun T.D., Siegel H.J., Beck N., A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing system, Journal of Parallel and Distributed Computing, 61, 6, pp. 810-837, (2001)
  • [4] Prashanth, SailRanga C., Ssanjeev B., A low complexity algorithm for dynamic scheduling of independent tasks onto heterogeneous computing systems, Proceedings of the 43rd annual Southeast regional conference, pp. 63-68, (2005)
  • [5] Michael P., Scheduling-Theory, Algorithms, And Systems, (1995)
  • [6] (2005)
  • [7] (1996)
  • [8] Tak L., Combinatorial Methods In The Theory Of Stochastic Processes, (1967)
  • [9] Graham R.L., Lawler E.L., Lenstra J.K., Et al., Optimization and approximation in deterministic sequencing and sche-duling: a survey, Annals of Discrete Mathematics, 5, pp. 287-326, (1979)
  • [10] Che X.-L., Hu D.-B., Hu L., Run-time prediction system of grid applications, Journal of Chinese Computer Systems, 29, 8, pp. 1476-1478, (2008)
1