4 votes

How LRU is used without special hardware?

The Linux kernel uses a (very rough) approximation of LRU, which is the reason why you find mention of LRU, even though it is not the true LRU algorithm. Here is a description taken from the source: ...
Vincenzo's user avatar
  • 3,252
3 votes

When is it best to use the second chance replacement algorithm?

Farthest-in-future is optimal, second chance can't be better. Second chance is a way to approximate LRU when the required hardware (access times, sort them) isn't available. Both try to approximate ...
vonbrand's user avatar
  • 13.9k
2 votes

LRU vs FIFO page replacement

For anyone visiting this thread in the future, FIFO can have less page faults in some scenarios. In this one ( <2, 6, 5, 7, ..., ..., ...> ), it can be completed with 2, 8, 6. The access of 2 ...
Person Giving Answer's user avatar
1 vote

Page fault, virtual memory

Both. The OS is software that executes on the processor.
D.W.'s user avatar
  • 156k
1 vote

Does optimal page replacement cause the same number of faults for the reverse string?

If we let $S^r$ be the reverse of a reference string $S$, then the page-fault rate for the OPT algorithm on $S$ is the same as the page-fault rate for the OPT algorithm on $S^r$. Similarly, the page-...
Faisal Sayed's user avatar
1 vote

NRU: Page fault on writing?

The idea is to mark a read/write page as read-only when loading it into memory (or after writing it out). If it is written to, a fault will occur. When handling the fault, the operating system looks ...
vonbrand's user avatar
  • 13.9k

Only top scored, non community-wiki answers of a minimum length are eligible