Question: Suppose R = 3, 2, 4, 3, 4, 2, 2, 3, 4, 5, 6, 7, 7, 6, 5, 4, 5, 6, 7, 2, 1 is

Suppose R = 3, 2, 4, 3, 4, 2, 2, 3, 4, 5, 6, 7, 7, 6, 5, 4, 5, 6, 7, 2, 1 is a page reference stream.

a. Given a page frame allocation of 3 and assuming the primary memory is initially unloaded, how many page faults will the given reference stream incur under Belady’s optimal algorithm?

b. Given a page frame allocation of 3 and assuming the primary memory is initially unloaded, how many page faults will the given reference stream incur under LRU?

c. Given a page frame allocation of 3 and assuming the primary memory is initially unloaded, how many page faults will the given reference stream incur under FIFO?

d. Given a window size of 6 and assuming the primary memory is initially unloaded, how many page faults will the given reference stream incur under the working-set algorithm?

e. Given a window size of 6 and assuming the primary memory is initially unloaded, what is the working-set size under the given reference stream after the entire stream has been processed?

Step by Step Solution

3.37 Rating (166 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

The page reference stream is 3 2 4 3 4 2 2 3 4 5 6 7 7 6 5 4 5 6 7 2 1 a ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

34-E-CE-OS (510).docx

120 KBs Word File

Students Have Also Explored These Related Computer Engineering Questions!