文件名称:jingchendiaodu
介绍说明－－下载内容均来自于网络，请自行研究使用
编写并调试一个模拟的进程调度程序，采用“最高优先数优先”调度算法对五个进程进行调度。
“最高优先数优先”调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。
静态优先数是在创建进程时确定的，并在整个进程运行期间不再改变。
动态优先数是指进程的优先数在创建进程时可以给定一个初始值，并且可以按一定原则修改优先数。-Write and debug a simulation of the process scheduler, using the top priority scheduling algorithm for scheduling the five process.
The basic idea of the top priority scheduling algorithm is to allocate the CPU to the highest priority process in the ready queue.
The static priority number is determined when the process is created and is no longer changed throughout the entire process.
Dynamic priority number refers to the process of priority number in the creation process can be given an initial value, and can be modified according to certain principles of priority number.
“最高优先数优先”调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。
静态优先数是在创建进程时确定的，并在整个进程运行期间不再改变。
动态优先数是指进程的优先数在创建进程时可以给定一个初始值，并且可以按一定原则修改优先数。-Write and debug a simulation of the process scheduler, using the top priority scheduling algorithm for scheduling the five process.
The basic idea of the top priority scheduling algorithm is to allocate the CPU to the highest priority process in the ready queue.
The static priority number is determined when the process is created and is no longer changed throughout the entire process.
Dynamic priority number refers to the process of priority number in the creation process can be given an initial value, and can be modified according to certain principles of priority number.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
最高优先数优先调度算法.txt