文件名称:jinchengdiaodu
-
所属分类:
- 标签属性:
- 上传时间:2013-03-16
-
文件大小:4.67kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
最高优先级优先”调度算法的基本思想是把CPU分配给就绪队列中优先级最高的进程。静态优先级是在创建进程时确定的,并在整个进程运行期间不再改变。
动态优先级是指进程的优先级在创建进程时可以给定一个初始值,并且可以按一定原则修改优先级。例如:在进程获得一次CPU后就将其优先级减少1,或者,进程等待的时间超过某一时限时增加其优先级的值,等等。
-The basic idea of the highest priority priority scheduling algorithm is assigned to the CPU ready queue with the highest priority process static priority is to determine when the process is created, and no longer changes during the run of the entire process.
Dynamic priority when the process is created, the priority of the process can be given an initial value, and can modify the priority of certain principles. For example: In the process of time the CPU after the decrease in its priority 1, or, process wait time exceeds a certain time limit, increase the priority value, and so on.
动态优先级是指进程的优先级在创建进程时可以给定一个初始值,并且可以按一定原则修改优先级。例如:在进程获得一次CPU后就将其优先级减少1,或者,进程等待的时间超过某一时限时增加其优先级的值,等等。
-The basic idea of the highest priority priority scheduling algorithm is assigned to the CPU ready queue with the highest priority process static priority is to determine when the process is created, and no longer changes during the run of the entire process.
Dynamic priority when the process is created, the priority of the process can be given an initial value, and can modify the priority of certain principles. For example: In the process of time the CPU after the decrease in its priority 1, or, process wait time exceeds a certain time limit, increase the priority value, and so on.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
jinchengdiaodu.doc
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.