## A class of page replacement algorithms for which the set of pages in memory for n frames is always a subset of the set of pages that would be in memory with n+1 frames.

## (Belady anomaly) if and only if (not a stack algorithm). WHY ?

## What about OPT ? LRU ?

## Both OPT and LRU are stack algorithms.

Previous slide | Next slide | Back to first slide | View graphic version |