Answer only 3 and 4 Suppose memory has 256KB, OS use low address 20KB, there is one program sequence: (20) • Prog1 request 80KB, prog2 request 16KB, • Prog3 request 140KB • Prog1 finish, Prog3 finish; • Prog4 request 80KB, Prog5 request 120kb • Use first match and best match to deal with this sequence • (from high address when allocated) • (1)Draw allocation state when prog1,2,3 are loaded into memory? • (2)Draw allocation state when prog1, 3 finish? • (3)use these two algorithms to draw the structure of free queue after prog1 , 3 finish(draw the allocation descriptor information,) • (4) Which algorithm is suitable for this sequence ? Describe the allocation process?
Answer only 3 and 4
Suppose memory has 256KB, OS use low address 20KB, there is one program sequence: (20)
• Prog1 request 80KB, prog2 request 16KB,
• Prog3 request 140KB
• Prog1 finish, Prog3 finish;
• Prog4 request 80KB, Prog5 request 120kb
• Use first match and best match to deal with this sequence
• (from high address when allocated)
• (1)Draw allocation state when prog1,2,3 are loaded into memory?
• (2)Draw allocation state when prog1, 3 finish?
• (3)use these two algorithms to draw the structure of free queue after prog1 , 3 finish(draw the allocation descriptor information,)
• (4) Which
Step by step
Solved in 3 steps with 3 images