Re: Clock sweep not caching enough B-Tree leaf pages?

From: Bruce Momjian <bruce(at)momjian(dot)us>
To: Atri Sharma <atri(dot)jiit(at)gmail(dot)com>
Cc: Peter Geoghegan <pg(at)heroku(dot)com>, Greg Stark <stark(at)mit(dot)edu>, Ants Aasma <ants(at)cybertec(dot)at>, Pg Hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: Clock sweep not caching enough B-Tree leaf pages?
Date: 2014-04-18 22:07:36
Message-ID: 20140418220736.GC16269@momjian.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On Sat, Apr 19, 2014 at 01:21:29AM +0530, Atri Sharma wrote:
> I feel that if there is no memory pressure, frankly it doesnt matter much about
> what gets out and what not. The case I am specifically targeting is when the
> clocksweep gets to move about a lot i.e. high memory pressure workloads. Of
> course,  I may be totally wrong here.
>
> One thing that I discussed with Merlin offline and am now concerned about is
> how will the actual eviction work. We cannot traverse the entire list and then
> find all the buffers with refcount 0 and then do another traversal to find the
> oldest one.

I thought if there was memory pressure the clock sweep would run and we
wouldn't have everything at the max counter access value.

--
Bruce Momjian <bruce(at)momjian(dot)us> http://momjian.us
EnterpriseDB http://enterprisedb.com

+ Everyone has their own god. +

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Tom Lane 2014-04-18 22:34:34 Re: Composite Datums containing toasted fields are a bad idea(?)
Previous Message Peter Geoghegan 2014-04-18 20:26:22 Re: Clock sweep not caching enough B-Tree leaf pages?