论文标题
基于动态的准备队的过程优先级调度算法
Dynamic Ready Queue Based Process Priority Scheduling Algorithm
论文作者
论文摘要
CPU调度是多处理和计时操作系统的性能的原因。不同的调度标准用于评估基于系统的不同属性的中央处理单元调度算法。众所周知，Round Robin是在分配时间单位和多处理操作系统的环境中使用的最常见的先发制人算法。在本文中，引入了循环算法的改革变化，以最大程度地减少完成时间，周转时间，等待时间和上下文开关的数量，从而导致系统性能更好。提议的工作包括根据准备时间到的时间和流程到达时间之间的时间之间的差异来计算优先级，以减轻准备队列的负担。我们还评估了在不同数据集上提出的方法的性能，并测量了不同的调度标准。
CPU scheduling is the reason behind the performance of multiprocessing and in time-shared operating systems. Different scheduling criteria are used to evaluate Central Processing Unit Scheduling algorithms which are based on different properties of the system. Round Robin is known to be the most recurrent pre-emptive algorithm used in an environment where processes are allotted a unit of time and multiprocessing operating systems. In this paper, a reformed variation of the Round Robin algorithm has been introduced to minimise the completion time, turnaround time, waiting time and number of context switches that results in the better performance of the system. The proposed work consists of calculation of priority on the basis of the difference between time spent in ready upto the moment and arrival time of the process, to ease up the burden on the ready queue. We have also evaluated the performance of the proposed approach on different datasets and measured the different scheduling criteria.
