Trusted by millions of Kenyans
LoginRegister
Study resources on Kenyaplex

Get ready-made curriculum aligned revision materials

Exam papers, notes, holiday assignments and topical questions – all aligned to the Kenyan curriculum.

Browse exam papers
Or go directly to:
Class notes Holiday assignments Topical questions Other resources

Name and describe four page replacement algorithms. Critically compare them with each other

Name and describe four page replacement algorithms. Critically compare them with each other

Answers

Faith
-OPTIMAL: Impossible to achieve, but perfect. Works on the Nostradamus-like basis that we can predict
which page won’t be used for the longest time, and elect that that one should be replaced.
-LEAST RECENTLY USED: Most commonly used, not quite optimal but better than the rest. We mark
every page with a timestamp and the one which has been least recently accessed gets the flick.
However we need to account for the extra overhead of adding/reading the time stamp, and who knows,
the next page we want to access might just be the one we’ve sent back to the aether. It’s quite a
performer though.
-CLOCK: Each page is marked with a ‘usage’ bit, and each is given a ‘second chance’ upon page
replacement time. The one that becomes unmarked first disappears. Not quite as accurate as LRU, but
has less of an overhead (one extra bit, as opposed to many for the timestamp).
-FIFO: The simple and dodgiest option, we make the foolish assumption that the oldest page in the queue
is the one that gets tossed. This is not quite always the case.
Titany answered the question on April 26, 2022 at 13:16

Answer Attachments

Next: Describe two virtual memory page fetch policies. Which is less common in practice? Why?

Previous: Describe buffering in the I/O subsystem of an operating system. Give reasons why it is required, and give a case where it is an advantage, and...

View more Operating Systems Questions and Answers  |  Return to Questions Index

Exams With Marking Schemes

Related Questions