文件名称:xianlaixianfuwu
介绍说明－－下载内容均来自于网络，请自行研究使用
在优先数算法中，进程优先数的初值设为：
50-NEEDTIME
每执行一次，优先数减1，CPU时间片数加1，进程还需要的时间片数减1。
在轮转法中，采用固定时间片单位（两个时间片为一个单位），进程每轮转一次，CPU时间片数加2，进程还需要的时间片数减2，并退出CPU，排到就绪队列尾，等待下一次调度。
-In the first few algorithm, the process priority number of initial set: 50-NEEDTIME Each time, priority number by 1, CPU time slice number plus 1, the process also need to reduce the number of time slice 1. In the rotation method, fixed time slice units (two time slots as a unit), the process once for each rotation, CPU time slice number plus 2, the process also need to reduce the number of time slice 2, and exit the CPU, discharged to ready queue tail, waiting for the next scheduling.
50-NEEDTIME
每执行一次，优先数减1，CPU时间片数加1，进程还需要的时间片数减1。
在轮转法中，采用固定时间片单位（两个时间片为一个单位），进程每轮转一次，CPU时间片数加2，进程还需要的时间片数减2，并退出CPU，排到就绪队列尾，等待下一次调度。
-In the first few algorithm, the process priority number of initial set: 50-NEEDTIME Each time, priority number by 1, CPU time slice number plus 1, the process also need to reduce the number of time slice 1. In the rotation method, fixed time slice units (two time slots as a unit), the process once for each rotation, CPU time slice number plus 2, the process also need to reduce the number of time slice 2, and exit the CPU, discharged to ready queue tail, waiting for the next scheduling.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
xianlaixianfuwu.c