Subject LRU page replacement
Author Jan Mikkelsen
Jim Starkey <jas@...> wrote:
>Page replacement is simple least recently used (LRU).

I have seen contention around LRU lists on multiprocessor systems (not in
Interbase, but in other contexts). A clock algorithm can actually provide a
win over LRU through reduced lock contention and book keeping, and avoiding
the pathological worst case where the page chosen for replacement under LRU
is always the page which will be needed next.

Are there any optimisations to LRU in Interbase to avoid that pathological
case (multiple scans through a set of pages greater than the size of the
buffer pool)?

Jan Mikkelsen