n Treats page frames allocated to a process as a circular buffer u When the buffer is full, the oldest page is replaced. Hence: first-in, first-out F This is not necessarily the same as the LRU page F A frequently used page is often the oldest, so it will be repeatedly paged out by FIFO u Simple to implement F requires only a pointer that circles through the page frames of the process