Question

Shot step by step. When a running process experiences a page fault, the frame to hold the missing page can only come from those frames allocated to that process, not from frames used by any other process. The memory system chooses which frame to use using a simple first-in-first-out technique. That is, the first time it must choose a frame to use to hold a page being loaded to resolve a page fault, it chooses the first frame it loaded originally. The second-page fault then uses the now ‘oldest’ frame (the second one that had been loaded originally), and so on: the first frame (originally) loaded becomes the first frame ‘out’ (i.e., to be reused). Each page fault causes only the one missing page to be loaded. Pages in this system are 4 Kbytes in size.

a) Suppose a program is executing a straight, linear sequence of instructions that is 100 KB long. This process is allocated 20 frames when put into memory. How many page faults will there be to completely execute this sequence of instruction?

b) Suppose the 100 KB block of instructions is a loop that repeats infinitely. How many page faults are there on the second iteration of the loop?

Answer 1

to 1 x 2 Given numbe ไ ซู fromn allocate 1-10 do becayse progrem wil be finst loaded into me mory and then 서?lote padu.altagp.sent ng fifo sgiven i os afte il eralen pe loaded in memory u ill be 6th 25, and page There will be Poge fouls fr