期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Chronically Evaluated Highest Instantaneous Priority Next: A Novel Algorithm for Processor Scheduling 被引量:1
1
作者 Amit Pandey Pawan Singh +1 位作者 Nirayo H. Gebreegziabher Abdella Kemal 《Journal of Computer and Communications》 2016年第4期146-159,共14页
This paper proposes a novel chronically evaluated highest instantaneous priority next processor scheduling algorithm. The currently existing algorithms like first come first serve, shortest job first, round-robin, sho... This paper proposes a novel chronically evaluated highest instantaneous priority next processor scheduling algorithm. The currently existing algorithms like first come first serve, shortest job first, round-robin, shortest remaining time first, highest response ratio next and varying response ratio priority algorithm have some problems associated with them. Some of them can lead to endless waiting or starvation and some of them like round-robin has problem of too many context switches and high waiting time associated with them. In the proposed algorithm, we have taken care of all such problems. As the novel algorithm is capable of achieving as good results as shortest remaining time first algorithm and also it will never lead to starvation. 展开更多
关键词 Chronically Evaluated Highest Instantaneous Priority Next cehipn Priority Scheduling Preemptive Scheduling Processor Scheduling STARVATION
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部