则由第一个索引块的最后一个字所指出的下一个索引块地址,读入该索引块,并用j作索引。由该索引块可获得物理块地址。依此类推。
2.(11分)
当前系统处于安全状态,安全序列如下求解:
work = Available = (3 , 3 , 2 )
寻找 Needj <= work = ( 3 , 3 , 2 ) ( j = 0 , 1 , 2 , 3 , 4)
j = 1 Need1 = (1 ,2 ,3 ) < = (3 , 3 , 2 )
work : = (3 , 3 , 2 ) + (2 ,0 ,0 ) = (5 , 3 , 2 )
寻找 Needj <= work = ( 5 , 3 , 2 ) ( j = 0 , 2 , 3 , 4)
j = 3 Need3 = (0 ,1 ,1 ) < = (5 , 3 , 2 )
work : = (5 , 3 , 2 ) + (2 ,1 ,1 ) = (7 , 4 , 3 )
寻找 Needj <= work = (7 , 4 , 3 ) ( j = 0 , 2 , 4)
j = 4 Need4 = (4 ,3 ,1 ) < = (7 , 4 , 3 )
work : = (7 , 4 , 3 ) + (0 ,0 ,2 ) = (7 , 4 , 5)
寻找 Needj <= work = (7 , 4 , 5) (j = 0 , 2 )
j = 2 Need2 = (6 ,0 ,0 ) < = (7 , 4 , 5 )
work : = (7 , 4 , 5 ) + (3 ,0 ,2 ) = (10 , 4 , 7)
寻找 Needj <= work = (10 , 4 , 7) ( j = 0 )
j = 0 work : = (10 , 4 , 7 ) + (0 ,1 ,0 ) = (10 , 5 , 7)
所以安全序列为。
3.(9分)
(1) 访问串为2,6,8,1,0,3,5,4,3,2,1,0,2,1
(2) WS
访问串 2 6 8 1 0 3 5 4 3 2 1 0 2 1
驻留集 2 2 2 2 0 0 0 0 3 3 3 3 1 1
6 6 6 6 3 3 3 5 5 1 1 0 0
8 8 8 8 5 5 4 4 4 0 2 2
1 1 1 4 2 2 2
-------------------------------------------------------------------------------------------------------------
大小 1 2 3 4 4 4 4 4 3 4 4 4 3 3
页故障 X X X X X X X X X X X 11次
VMIN
访问串 2 6 8 1 0 3 5 4 3 2 1 0 2 1
驻留集 2 6 8 1 0 3 3 3 3 2 2 2 2 1
5 4 1 1 1
0
-------------------------------------------------------------------------------------------------------------
大小 1 1 1 1 1 1 2 2 1 1 2 3 2 1
页故障 X X X X X X X X X X X 11次
4.(9分)
(0,430)物理地址 219+430=649
(1,10) 物理地址 2300+10=2310
(2,500) 500大于段长,越界,不能转换
(3,400) 物理地址 1327+400=1727
(4,112) 112>段长96不能转换,越界。
(5,120) 段号越界,不能转换。