423A35C7/os_kernel_lab
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

update hw2,3

Browse Source
This commit is contained in:
chyyuu 2013-10-17 09:28:22 +08:00
parent 6b343cb2bb
commit b76a66aa72
2 changed files with 10 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
homework/hw2.txt
View File

@ -55,6 +55,11 @@ c. What is the minimumnumber of page faults for an optimal page-
replacement strategy for the reference string in part b with four
page frames?
1. 请证明LRU算法不会存在belady现象。
2. 请证明或详细说明FIFO/CLOCK/Enhanced CLOCK是否有belady现象？
实验相关
------------------
@ -78,3 +83,6 @@ IF before clock sweep: (used,dirty) = (1,1), THEN after clock sweep: (used, dirt
8 如果在ucore中实现精确的LRU算法，如何设计？需要硬件和OS分别完成什么事情？
9 如果在ucore中实现工作集页替换算法和缺页频率替换算法，如何设计？

2
homework/hw3.txt
View File

@ -7,4 +7,6 @@
6. 父进程与子进程之间在内容上有何差异？在执行上有何差异？
7. 父进程fork完子进程后，这两个进程在执行的过程中是否有先后顺序？
8. 进程/线程上下文切换的执行逻辑是什么？二者有无区别？如有，区别是啥？
9. 为何vfork机制在有了Copy on Write (简称COW)技术后意义变得不大了？
10. 如何在ucore中实现COW技术？