We are not saying FIFO is bad. We chose this example to show how FIFO works, not
to diminish its appeal as a swapping policy. The high failure rate here is caused by
both the limited amount of memory available and the order in which pages are
requested by the program. The page order can’t be changed by the system, although
the size of main memory can be changed; but buying more memory may not always
be the best solution—especially when you have many users and each one wants an
unlimited amount of memory. There is no guarantee that buying more memory will
always result in better performance; this is known as the FIFO anomaly, which is
explained later in this chapter.