摘要
短进程优先算法在实际生活中有着广泛的应用,通过分析内排序算法中的交换排序算法思想,并对交换排序算法实现进行了加工,提出了一种新算法证明短进程优先算法平均等待时间最短。
The short-job-first algorithm has massive appliction in real life.In this paper,we analyze and revise the exchange sorting algorithm of the internal sorting category.Then we propose a new algorithm to prove that the short-job-first algorithm has the least mean waiting time.
出处
《电脑知识与技术》
2011年第8X期5931-5932,共2页
Computer Knowledge and Technology
