Re: [HACKERS] Parallel tuplesort (for parallel B-Tree index creation)
Rushabh Lathia <rushabh.lathia@gmail.com>
Thanks Tels for reviewing the patch. On Fri, Dec 8, 2017 at 2:54 PM, Tels <nospam-pg-abuse@bloodgate.com> wrote: > Hello Rushabh, > > On Fri, December 8, 2017 2:28 am, Rushabh Lathia wrote: > > Thanks for review. > > > > On Fri, Dec 8, 2017 at 6:27 AM, Peter Geoghegan <pg@bowt.ie> wrote: > > > >> On Thu, Dec 7, 2017 at 12:25 AM, Rushabh Lathia > >> <rushabh.lathia@gmail.com> wrote: > >> > 0001-Add-parallel-B-tree-index-build-sorting_v14.patch > > I've looked only at patch 0002, here are some comments. > > > + * leaderasworker indicates whether leader going to participate as > worker or > > + * not. > > The grammar is a bit off, and the "or not" seems obvious. IMHO this could > be: > > + * leaderasworker indicates whether the leader is going to participate as > worker > > Sure. > The argument leaderasworker is only used once and for one temp. variable > that is only used once, too. So the temp. variable could maybe go. > > And not sure what the verdict was from the const-discussion threads, I did > not follow it through. If "const" is what should be done generally, then > the argument could be consted, as to not create more "unconsted" code. > > E.g. so: > > +plan_create_index_workers(Oid tableOid, Oid indexOid, const bool > leaderasworker) > > Make sense. > and later: > > - sort_mem_blocks / (parallel_workers + 1) < > min_sort_mem_blocks) > + sort_mem_blocks / (parallel_workers + (leaderasworker > ? 1 : 0)) < min_sort_mem_blocks) > > Even I didn't liked to take a extra variable, but then code looks bit unreadable - so rather then making difficult to read the code - I thought of adding new variable. > Thank you for working on this patch! > > I will address review comments in the next set of patches. Regards, Rushabh Lathia 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