搜索资源列表
-
0下载:
设计一程式可输入
1、几个行程
2、每个行程各别的CPU暴冲时间(毫秒)
3、到达时间
4、优先顺序
并求出
1、FCFS
2、SJF - 不可抢先
3、SJF - 可抢先
4、Priority
5、RR
平均等待时间
-
-
1下载:
采用仿真实验的方法,分析和评价FCFS、SJF、RR和MLFS算法的优劣,用c++实现四种调度算法,源代码如下,思路程序内有注解-Method using simulation, analysis and evaluation of FCFS, SJF, RR, and MLFS merits of the algorithm, using c++ to achieve the four scheduling algorithms, source code is as follows, idea
-
-
0下载:
Cpu scheduling. Shortest Job First(SJF)preemption and Nonpreemption
-
-
0下载:
Cpu scheduling. Shortest Job First(SJF)preemption and Nonpreemption
-