文件名称:jinchen1
介绍说明－－下载内容均来自于网络，请自行研究使用
用C语言实现进程调度－操作系统课程设计设计思想：
“最高优先数优先”调度算法的基本思想是把cpu分配给就绪队列中优先数最高的进程。采用动态优先数，即优先数在创建进程时给定一个初始值，当进程获得一次cpu后其优先数就减少1。-C language scheduling process-design courses on operating system design : "Priority number of the highest priority" scheduling algorithm the basic idea is cpu allocated to the parade were in place the highest priority in the process. Dynamic priority, which is priority number in the creation process to set an initial value, When the process is a cpu after its priority on reducing the number of one.
“最高优先数优先”调度算法的基本思想是把cpu分配给就绪队列中优先数最高的进程。采用动态优先数，即优先数在创建进程时给定一个初始值，当进程获得一次cpu后其优先数就减少1。-C language scheduling process-design courses on operating system design : "Priority number of the highest priority" scheduling algorithm the basic idea is cpu allocated to the parade were in place the highest priority in the process. Dynamic priority, which is priority number in the creation process to set an initial value, When the process is a cpu after its priority on reducing the number of one.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
新建 RTF 文档.rtf