From: | Atri Sharma <atri(dot)jiit(at)gmail(dot)com> |
---|---|
To: | Ants Aasma <ants(at)cybertec(dot)at> |
Cc: | Amit Kapila <amit(dot)kapila(at)huawei(dot)com>, PostgreSQL-development <pgsql-hackers(at)postgresql(dot)org> |
Subject: | Re: Page replacement algorithm in buffer cache |
Date: | 2013-03-22 13:59:31 |
Message-ID: | CAOeZVifY6416f6++yti+-DJBQtw2VKOpQH9bwFJYn3PxzB6f7A@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
>
> However, I think the main issue isn't finding new algorithms that are
> better in some specific circumstances. The hard part is figuring out
> whether their performance is better in general. My idea was to create
> a patch to capture page pinning traffic from PostgreSQL (maybe stream
> out into a per backend file), run it with some production workloads
> and use that to generate testing workloads for the cache replacement
> policies. Haven't gotten round to actually doing that though.
>
> [1] http://en.wikipedia.org/wiki/LIRS_caching_algorithm
Thanks for the link. I think LIRS can indeed be helpful in our case.
We should indeed build some test cases for testing this theory. I am
all for capturing page replacement and usage data and analyzing it.
Atri
--
Regards,
Atri
l'apprenant
From | Date | Subject | |
---|---|---|---|
Next Message | Tom Lane | 2013-03-22 14:02:39 | Re: Page replacement algorithm in buffer cache |
Previous Message | Andrew Dunstan | 2013-03-22 13:58:37 | Re: JSON Function Bike Shedding |