Обсуждение: [HACKERS] Shared Memory hash tables only at startup

Поиск
Список
Период
Сортировка

[HACKERS] Shared Memory hash tables only at startup

От
hariprasath nallasamy
Дата:
Hi
  It is clear that all of the shared memory hash tables are created during startup using ShmemInitHash()
 

(In practice, all creations are done in the postmaster
process; child processes should always be attaching to existing tables.)


Is there any specific reason to do so or my understanding was wrong(we can create shared memory hash table at run time too?)



TIA
 harry

Re: [HACKERS] Shared Memory hash tables only at startup

От
Tom Lane
Дата:
hariprasath nallasamy <hariprasathnallasamy@gmail.com> writes:
> *(In practice, all creations are done in the postmasterprocess; child
> processes should always be attaching to existing tables.)*

Yeah ...

> Is there any specific reason to do so or my understanding was wrong(we can
> create shared memory hash table at run time too?)

Well, if you don't mind resolving the race conditions that you're going to
have, you could possibly do that.  In practice though, unless it's a very
small hash table, it's going to need to be accounted for in the sizing
calculations in CreateSharedMemoryAndSemaphores, which means you might
as well create it during that function too.
        regards, tom lane



Re: [HACKERS] Shared Memory hash tables only at startup

От
Thomas Munro
Дата:
On Tue, May 2, 2017 at 11:54 PM, hariprasath nallasamy
<hariprasathnallasamy@gmail.com> wrote:
> Hi
>   It is clear that all of the shared memory hash tables are created during
> startup using ShmemInitHash()
>
> (In practice, all creations are done in the postmaster
> process; child processes should always be attaching to existing tables.)
>
> Is there any specific reason to do so or my understanding was wrong(we can
> create shared memory hash table at run time too?)

Because we use processes and not threads, the space has to be
allocated up front and then inherited by other process in order to
inherit the same memory map so that raw pointers can be exchanged
between backends.  DynaHash is a data structure made out of raw
pointers.

I have a proposal[1] that would provide dynamic concurrent hash tables
that can be created after startup using DSM/DSA memory, but then you
have to deal with kooky pointers, which falls out of Postgres's
policies of avoiding multithreading and embracing parallelism.

[1]
https://www.postgresql.org/message-id/flat/CAEepm%3D3d8o8XdVwYT6O%3DbHKsKAM2pu2D6sV1S_%3D4d%2BjStVCE7w%40mail.gmail.com

-- 
Thomas Munro
http://www.enterprisedb.com