Re: Page replacement algorithm in buffer cache

Поиск
Список
Период
Сортировка
От Tom Lane
Тема Re: Page replacement algorithm in buffer cache
Дата
Msg-id 29181.1363981925@sss.pgh.pa.us
обсуждение исходный текст
Ответ на Re: Page replacement algorithm in buffer cache  (Merlin Moncure <mmoncure@gmail.com>)
Ответы Re: Page replacement algorithm in buffer cache  (Merlin Moncure <mmoncure@gmail.com>)
Список pgsql-hackers
Merlin Moncure <mmoncure@gmail.com> writes:
> On Fri, Mar 22, 2013 at 1:13 PM, Atri Sharma <atri.jiit@gmail.com> wrote:
>> What is the general thinking? Is it time to start testing again and
>> thinking about improvements to the current algorithm?

> well, what problem are you trying to solve exactly?  the main problems
> I see today are not so much in terms of page replacement but spinlock
> and lwlock contention.

Even back when we last hacked on that algorithm, the concerns were not
so much about which pages it replaced as how much overhead and
contention was created by the management algorithm.  I haven't seen any
reason to think we have a problem with the quality of the replacement
choices.  The proposal to increase the initial usage count would
definitely lead to more overhead/contention, though, because it would
result in having to circle around all the buffers more times (on
average) to get a free buffer.
        regards, tom lane



В списке pgsql-hackers по дате отправления:

Предыдущее
От: Tom Lane
Дата:
Сообщение: Re: Materialized view assertion failure in HEAD
Следующее
От: Greg Stark
Дата:
Сообщение: Re: dump, restore, dump yields differences