优先级调度算法动态优先级_与优先级调度有关的问题及其解决方案

优先级调度算法动态优先级

We are already familiar with what Priority Scheduling is. It is one of the most used process scheduling algorithm used in operating systems, in which every process is assigned with a priority. According to this algorithm, the process with the highest priority is set to be provided the CPU first or simply is to be executed first.

我们已经熟悉什么是优先调度。 它是操作系统中使用最广泛的进程调度算法之一，在该算法中，每个进程都分配了优先级。 根据该算法，将优先级最高的过程设置为首先提供给CPU或简单地首先执行。

In priority scheduling algorithm, a major problem to be considered is the starvation of a process i.e. a process which is ready to be executed but is waiting for the CPU because of its low priority. This can lead to the indefinite waiting of the low-priority processes. A continuous flow of higher priority processes to the O.S can prevent a low priority process from ever getting the CPU.

在优先级调度算法中 ，要考虑的主要问题是进程的