推 qazwsxee:17469篇~已有解 02/12 19:40
→ taitin:用2的倍數來分配 02/12 19:43
→ taitin:p1 128 p2 256 p3 64 p4 256 p5 128 02/12 19:44
3.
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%)
其實我只是想問第3題我翻紅翼的筆記裡面斯乎沒有這個東西
解答寫的我也看不懂是什麼意思 有人會可以教一下嗎??
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.217.232.3