| From: | Peter Geoghegan <pg(at)bowt(dot)ie> |
|---|---|
| To: | Amit Kapila <amit(dot)kapila16(at)gmail(dot)com> |
| Cc: | Thomas Munro <thomas(dot)munro(at)enterprisedb(dot)com>, Robert Haas <robertmhaas(at)gmail(dot)com>, Rushabh Lathia <rushabh(dot)lathia(at)gmail(dot)com>, Heikki Linnakangas <hlinnaka(at)iki(dot)fi>, Pg Hackers <pgsql-hackers(at)postgresql(dot)org>, Corey Huinker <corey(dot)huinker(at)gmail(dot)com> |
| Subject: | Re: [HACKERS] Parallel tuplesort (for parallel B-Tree index creation) |
| Date: | 2018-01-20 04:50:20 |
| Message-ID: | CAH2-Wz=eXfYdsFQh2HrqzgfM9TQZa-r13DfwEHYWb0OBg8-HAQ@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Fri, Jan 19, 2018 at 8:44 PM, Amit Kapila <amit(dot)kapila16(at)gmail(dot)com> wrote:
> Right, but I think using parallel_leader_participation, you can do it
> reliably and probably write some regression tests which can complete
> in a predictable time.
Do what reliably? Guarantee that the leader will not participate as a
worker, but that workers will be used? If so, yes, you can get that.
The only issue is that you may not be able to launch parallel workers
due to hitting a limit like max_parallel_workers, in which case you'll
get a serial index build despite everything. Nothing we can do about
that, though.
--
Peter Geoghegan
| From | Date | Subject | |
|---|---|---|---|
| Next Message | John Naylor | 2018-01-20 05:00:15 | Re: MCV lists for highly skewed distributions |
| Previous Message | Amit Kapila | 2018-01-20 04:44:32 | Re: [HACKERS] Parallel tuplesort (for parallel B-Tree index creation) |