Re: [HACKERS] Parallel tuplesort (for parallel B-Tree index creation)
Amit Kapila <amit.kapila16@gmail.com>
On Mon, Jan 22, 2018 at 12:50 AM, Peter Geoghegan <pg@bowt.ie> wrote: > On Sat, Jan 20, 2018 at 8:38 PM, Amit Kapila <amit.kapila16@gmail.com> wrote: >> It would have been better if there were some comments besides that >> field, but I think it has been covered at another place in the code. >> See comments in LaunchParallelWorkers(). >> >> /* >> * Start workers. >> * >> * The caller must be able to tolerate ending up with fewer workers than >> * expected, so there is no need to throw an error here if registration >> * fails. It wouldn't help much anyway, because registering the worker in >> * no way guarantees that it will start up and initialize successfully. >> */ > > Why is this okay for Gather nodes, though? nodeGather.c looks at > pcxt->nworkers_launched during initialization, and appears to at least > trust it to indicate that more than zero actually-launched workers > will also show up when "nworkers_launched > 0". This trust seems critical > when parallel_leader_participation is off, because "node->nreaders == > 0" overrides the parallel_leader_participation GUC's setting (note > that node->nreaders comes directly from pcxt->nworkers_launched). If > zero workers show up, and parallel_leader_participation is off, but > pcxt->nworkers_launched/node->nreaders is non-zero, won't the Gather > never make forward progress? > Ideally, that situation should be detected and we should throw an error, but that doesn't happen today. However, it will be handled with Robert's patch on the other thread for CF entry [1]. [1] - https://commitfest.postgresql.org/16/1341/ -- With Regards, Amit Kapila. EnterpriseDB: http://www.enterprisedb.com
Commits
-
Support parallel btree index builds.
- 9da0cc35284b 11.0 landed
-
Report an ERROR if a parallel worker fails to start properly.
- 2badb5afb89c 11.0 cited
-
Transfer state pertaining to pending REINDEX operations to workers.
- 29d58fd3adae 11.0 landed
-
Add a barrier primitive for synchronizing backends.
- 1145acc70deb 11.0 cited
-
Allow DML commands that create tables to use parallel query.
- e9baa5e9fa14 11.0 cited
-
Refactor GetOldestXmin() to use flags
- af4b1a0869bd 10.0 cited
-
Fix regression in parallel planning against inheritance tables.
- 2609e91fcf9d 10.0 cited
-
Don't create "holes" in BufFiles, in the new logtape code.
- 7ac4a389a7db 10.0 cited
-
Simplify the code for logical tape read buffers.
- b75f467b6eec 10.0 cited
-
Fix excessive memory consumption in the new sort pre-reading code.
- b56fb691b003 10.0 cited
-
Implement binary heap replace-top operation in a smarter way.
- 24598337c8d2 10.0 cited
-
Cosmetic code cleanup in commands/extension.c.
- 25794e841e5b 10.0 cited
-
Speed up planner's scanning for parallel-query hazards.
- da1c91631e35 10.0 cited
-
Read from the same worker repeatedly until it returns no tuple.
- bc7fcab5e36b 9.6.0 cited
-
Improve tuplesort.c to support variable merge order. The original coding
- df700e6b4019 8.2.0 cited