作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (9): 41-43. doi: 10.3969/j.issn.1000-3428.2010.09.014

• 软件技术与数据库 • 上一篇    下一篇

智能网络磁盘系统的任务排序研究

刘敏娜,赵跃龙   

  1. (华南理工大学计算机科学与工程学院,广州 510640)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-05-05 发布日期:2010-05-05

Study on Task Schedule in Intelligent Network Disk System

LIU Min-na, ZHAO Yue-long   

  1. (School of Computer Science and Engineering, South China University of Technology, Guangzhou 510640)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-05-05 Published:2010-05-05

摘要: 针对智能网络磁盘存储系统中已有的排序算法会导致大量任务长期得不到响应而引起的“饥饿”现象,对该算法进行改进。将任务划分成步骤链并根据步骤链的执行时间及权重计算出 因子,设定 因子的浮动限 和所在任务的已执行时间限 。实验结果表明,改进的排序算法能很好地解决“饥饿”现象,使任务的加权总完成时间近似最优。

关键词: 智能网络磁盘, 排序算法, 时间复杂性, 三元组

Abstract: To overcome the starvation phenomena caused by the existing algorithm for the response time of a lot of tasks is longer in the Intelligent Network Disk(IND) system, an improved algorithm is presented. In the algorithm, factors of tasks are computed by the execution time and weight of step chains, and the range of factors and the limit of executed time of tasks are set. Experimental results demonstrate that it solves the starvation phenomena at a certain extent and makes the weighted total completion time approximately best.

Key words: Intelligent Network Disk(IND), schedule algorithm, time complexity, triple

中图分类号: