Also known FIFO anomaly. Generally, on raising the number of frames given to a process' virtual storage, the program execution is faster, because lesser page faults happens. Sometimes, the reverse occur, i.e., the run time increases even when more frames are distributed to the process. That is Belady's Anomaly. This is right for some page instance references patterns.