From: | Peter Geoghegan <pg(at)heroku(dot)com> |
---|---|
To: | Robert Haas <robertmhaas(at)gmail(dot)com> |
Cc: | Thomas Munro <thomas(dot)munro(at)enterprisedb(dot)com>, Pg Hackers <pgsql-hackers(at)postgresql(dot)org> |
Subject: | Re: WIP: Barriers |
Date: | 2016-08-16 22:23:26 |
Message-ID: | CAM3SWZS8A2PacQ4pFzDHFaj_1bXndX-E4Afyhi6i1-uDfiq7Pg@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On Mon, Aug 15, 2016 at 6:55 AM, Robert Haas <robertmhaas(at)gmail(dot)com> wrote:
> A sort of dumb way of handling all this is to assume that once a
> worker joins the hash join, it won't go off and do anything else until
> the hash join is done. Under that assumption, you just need some sort
> of BarrierAttach() operation; workers that have never attached the
> barrier aren't participating in the hash join at all and so they are
> irrelevant - and now you know how many workers you need to await,
> because you can keep a count how many have attached. Perhaps you
> simply turn away any workers that arrive after batch 0 is complete.
Is that really so bad? In general, I don't tend to think of workers as
the cost to worry about. Rather, we should be concerned about the
active use of CPU cores as our major cost.
--
Peter Geoghegan
From | Date | Subject | |
---|---|---|---|
Next Message | Peter Geoghegan | 2016-08-16 22:28:53 | Re: WIP: Barriers |
Previous Message | Peter Geoghegan | 2016-08-16 22:20:06 | Re: WIP: Barriers |