摘要
针对智能网络磁盘存储系统中已有的排序算法会导致大量任务长期得不到响应而引起的"饥饿"现象,对该算法进行改进。将任务划分成步骤链并根据步骤链的执行时间及权重计算出ρ因子,设定ρ因子的浮动限?θ和所在任务的已执行时间限?t。实验结果表明,改进的排序算法能很好地解决"饥饿"现象,使任务的加权总完成时间近似最优。
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.
出处
《计算机工程》
CAS
CSCD
北大核心
2010年第9期41-43,共3页
Computer Engineering
基金
国家自然科学基金资助项目(60573145)
教育部博士点基金资助项目(200805610019)
湖南省自然科学基金资助项目(05JJ30120)
广州市科技计划基金资助项目(2007J1-2C0401)
关键词
智能网络磁盘
排序算法
时间复杂性
三元组
Intelligent Network Disk(IND)
schedule algorithm
time complexity
triple