Warning: The hard deadline has passed. You can attempt it, but you will not get credit for it. You are welcome to try it as a learning exercise.
var A:array [1..128,1..256] of integer;
for j:= 1 to 256 do
for i:= 1 to 128 do
A[i, j]:= 0;
若页面置换算法采用先进先出算法(FIFO),则该进程执行时会产生多少次缺页异常?
①根据虚页号查找页表,得到对应的页表项
②根据虚页号查找快表TLB,得到对应的页框号
③根据页表项中的页框号与页内偏移形成物理地址
④MMU产生Page Fault,陷入操作系统,执行缺页异常处理程序
下列选项中,哪一项不是MMU的正确工作顺序?