作者newman1125 (newman)
看板Grad-ProbAsk
标题[理工] [OS]98高雄大学
时间Fri Feb 12 17:30:13 2010
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
1F：推 qazwsxee:17469篇~已有解 02/12 19:40
2F：→ taitin:用2的倍数来分配 02/12 19:43
3F：→ taitin:p1 128 p2 256 p3 64 p4 256 p5 128 02/12 19:44