As you can see, I already have answers to this question. Please explain how to g

Question

As you can see, I already have answers to this question. Please explain how to get these answers. I can't figure out what is going on here.

1. Suppose the page size is 4096 bytes. Assume that a process issued the ? 1000 ? loool-10000 000 ooo ) following address sequence (in hexadecimal): 7025 7-D015 8111 p8-?11,6 1517807701 7026 (7-00116 7027?1 021. 1ACO P1-DACO 6 Suppose the process is assigned 3 page frames. How many faults would be produced while servicing the above memory requests under the following page replacement policies times a p Paye fue a. LRU b. OPT c. FIFO d. Clock 81 is Qlesseo 18x

Explanation / Answer

LRU A nice approximate to an optimal algorithm is based on the vision that pages that have been highly used in the last few directives will maybe highly used again next. Conversely, pages that have not been used for ages will probably remain unused for a long time. This idea suggests a realizable algorithm: when a page fault occurs, throw out the page that has been unused for the longest time. This strategy is called LRU. OPT ?Better page replacement algorithm is easy to show but not possible to apply. It proceeds like. The moment when a page fault occurs, some pages are in memory. One of those pages are referenced on the consecutive next command. Other pages may not be referenced until 10, 100, or perhaps 1000 commands later. FIFO ?FIFO (First-In, First-Out) algorithm. Its like a pipe the first one to enter wents out first. Imagine a person in a queue comes first, he will move out of queue first. Clock ?It achieves benefits of a LRU algorithim, but without manipulating the LRU bits.

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.