[作業] 作業系統 HW5 題目
5.1
Why is it important for the scheduler to distinguish I/O-bound programs from
CPU-bound programs?
5.7
Explain the differences in how much the following scheduling algorithms
discriminate in favor of short process:
a. FCFS
b. RR
c. Multilevel feedback queues
5.9
Which of the following scheduling algorithms could result in starvation?
a. First-come , first-served
b. Shortest job first
c. Round robin
d. Priority
5.13
Consider the following set of processes, with the length of the CPU burst
given in milliseconds:
Process Burst Time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
The processes are assumed to have arrived in the order P1,P2,P3,P4,P5,all
at time 0.
a. Draw four Gantt charts that illustrate the execution of these processes
using the following scheduling algorithms : FCFS, SJF, nonpreemptive priority
(a smaller priority number implies a higher priority), and RR(quantum = 1)
b. What is the turnaround time of each process for each of the scheduling
algorithms in part a?
c. What is the waiting time of each process for each of these scheduling
algorithms?
d. Which of the algorithms results in the minimum average waiting time
(over all processes)?
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 114.43.194.49
推
04/23 13:39, , 1F
04/23 13:39, 1F
→
04/23 16:06, , 2F
04/23 16:06, 2F