Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

okay here was first part to question which includes size of instruction. Please

ID: 3793023 • Letter: O

Question

okay here was first part to question which includes size of instruction. Please show all work

Suppose you have a system that uses virtual memory with 4 KB pages.  Every instruction on this
computer uses exactly 2 words of memory. How many instructions are on a page?

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.

Now 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 instructions?

Finally, 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?

Explanation / Answer

Suppose you have a system that uses virtual memory with 4 KB pages.  Every instruction on this
computer uses exactly 2 words of memory. How many instructions are on a page? --

page=4KB=4*210*8 bits

instruction size= 2 words= 2* 8 bites

no. of instructions=4*210*8/ 2* 8=211