推 qazwsxee:等等用回文幫你答 01/28 18:03
Consider a computer system with 1MB user space memory
and using buddy system as the scheme for memory allocation.
Initially, all processes are in disk job pool.
Give the following information:
Process CPU cycle (sec) Arrival time (sec) Process size
P1 8 0 100K
P2 4 2 240K
P3 2 8 64K
P4 5 6 256K
P5 10 4 75K
Consider two CPU scheduling algorithms: FCFS, preemptive SJF,
RR with time quantum = 7. Please answer the following questions.
1) Draw the Gantt chart for each algorithm. (12%)
2) Compute the average waiting time for each algorithm. (6%)
3) For each scheduling algorithm, show the memory configuration snapshoot
(i.e., which range of memory is used to allocate which process,
and which range denote available space)
at the time when process P4 starts execution. (12%)
請問一下第三題是要做什麼? 有大大能幫忙解答的嗎?
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 114.47.222.188