Re: [HACKERS] Clock with Adaptive Replacement - Mailing list pgsql-hackers

From Merlin Moncure
Subject Re: [HACKERS] Clock with Adaptive Replacement
Date
Msg-id CAHyXU0xTYFxLeBzS6cfAHEkd_pancJg_u9GCZVDtXuCp0JrvFg@mail.gmail.com
Whole thread Raw
In response to Re: [HACKERS] Clock with Adaptive Replacement  (Robert Haas <robertmhaas@gmail.com>)
Responses Re: [HACKERS] Clock with Adaptive Replacement  (Robert Haas <robertmhaas@gmail.com>)
List pgsql-hackers
On Wed, May 9, 2018 at 11:00 AM Robert Haas <robertmhaas@gmail.com> wrote:

> Independently of that, it would be probably also useful to avoid
> bumping the reference count multiple times when a buffer is accessed
> by the same backend several times in quick succession.  Perhaps this
> could even be as simple as maintaining a list of the last two buffer
> IDs for which we bumped the usage count; if we see one of them again,
> don't bump the usage count again.

Hm.  Is the objective here to optimize access patterns or to reduce atomic
operations (or both)?   All else being equal, an algorithm that delivers
the similar eviction results with less cache synchronization ought to be
preferred...are the various algorithms scored in that way?

merlin


pgsql-hackers by date:

Previous
From: Alvaro Herrera
Date:
Subject: Re: [SPAM] Re: Local partitioned indexes and pageinspect
Next
From: Robert Haas
Date:
Subject: Re: [HACKERS] Clock with Adaptive Replacement