Received: from malur.postgresql.org ([217.196.149.56]) by arkaria.postgresql.org with esmtp (Exim 4.72) (envelope-from ) id 1UMlyq-0000ea-Bb for pgsql-hackers@arkaria.postgresql.org; Mon, 01 Apr 2013 21:09:28 +0000 Received: from localhost ([127.0.0.1] helo=postgresql.org) by malur.postgresql.org with smtp (Exim 4.72) (envelope-from ) id 1UMlyp-0007Oz-Of for pgsql-hackers@arkaria.postgresql.org; Mon, 01 Apr 2013 21:09:27 +0000 Received: from makus.postgresql.org ([2001:4800:7903:4::125]) by malur.postgresql.org with esmtp (Exim 4.72) (envelope-from ) id 1UMlyp-0007Ou-1d for pgsql-hackers@postgresql.org; Mon, 01 Apr 2013 21:09:27 +0000 Received: from mail.anarazel.de ([217.115.131.40]) by makus.postgresql.org with esmtp (Exim 4.72) (envelope-from ) id 1UMlym-0001Qj-8x for pgsql-hackers@postgresql.org; Mon, 01 Apr 2013 21:09:26 +0000 Received: from intern.anarazel.de (p549F14D0.dip.t-dialin.net [84.159.20.208]) (Authenticated sender: andres@anarazel.de) by mail.anarazel.de (Postfix) with ESMTPSA id F0F7A4E8003; Mon, 1 Apr 2013 23:09:20 +0200 (CEST) Date: Mon, 1 Apr 2013 23:09:20 +0200 From: Andres Freund To: Merlin Moncure Cc: Jeff Janes , Ants Aasma , Tom Lane , Atri Sharma , Greg Stark , Amit Kapila , PostgreSQL-development Subject: Re: Page replacement algorithm in buffer cache Message-ID: <20130401210920.GC7244@alap2.anarazel.de> References: <29181.1363981925@sss.pgh.pa.us> <29748.1363983378@sss.pgh.pa.us> MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: X-Pg-Spam-Score: -2.6 (--) List-Archive: List-Help: List-ID: List-Owner: List-Post: List-Subscribe: List-Unsubscribe: X-Mailing-List: pgsql-hackers Precedence: bulk Sender: pgsql-hackers-owner@postgresql.org On 2013-04-01 08:28:13 -0500, Merlin Moncure wrote: > On Sun, Mar 31, 2013 at 1:27 PM, Jeff Janes wrote: > > On Friday, March 22, 2013, Ants Aasma wrote: > >> > >> On Fri, Mar 22, 2013 at 10:22 PM, Merlin Moncure > >> wrote: > >> > well if you do a non-locking test first you could at least avoid some > >> > cases (and, if you get the answer wrong, so what?) by jumping to the > >> > next buffer immediately. if the non locking test comes good, only > >> > then do you do a hardware TAS. > >> > > >> > you could in fact go further and dispense with all locking in front of > >> > usage_count, on the premise that it's only advisory and not a real > >> > refcount. so you only then lock if/when it's time to select a > >> > candidate buffer, and only then when you did a non locking test first. > >> > this would of course require some amusing adjustments to various > >> > logical checks (usage_count <= 0, heh). > >> > >> Moreover, if the buffer happens to miss a decrement due to a data > >> race, there's a good chance that the buffer is heavily used and > >> wouldn't need to be evicted soon anyway. (if you arrange it to be a > >> read-test-inc/dec-store operation then you will never go out of > >> bounds) However, clocksweep and usage_count maintenance is not what is > >> causing contention because that workload is distributed. The issue is > >> pinning and unpinning. > > > > > > That is one of multiple issues. Contention on the BufFreelistLock is > > another one. I agree that usage_count maintenance is unlikely to become a > > bottleneck unless one or both of those is fixed first (and maybe not even > > then) > > usage_count manipulation is not a bottleneck but that is irrelevant. > It can be affected by other page contention which can lead to priority > inversion. I don't be believe there is any reasonable argument that > sitting and spinning while holding the BufFreelistLock is a good idea. In my experience the mere fact of (unlockedly, but still) accessing all the buffer headers can cause noticeable slowdowns in write only/mostly workloads with big amounts of shmem. Due to the write only nature large amounts of the buffers have a similar usagecounts (since they are infrequently touched after the initial insertion) and there are no free ones around so the search for a buffer frequently runs through *all* buffer headers multiple times till it decremented all usagecounts to 0. Then comes a period where free buffers are found easily (since all usagecounts from the current sweep point onwards are zero). After that it starts all over. I now have seen that scenario multiple times :( Greetings, Andres Freund -- Andres Freund http://www.2ndQuadrant.com/ PostgreSQL Development, 24x7 Support, Training & Services -- Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers