Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[aggregator] Avoid large copies in entry rollup comparisons by making them more inline-friendly #3195

Merged
merged 4 commits into from
Feb 9, 2021

Conversation

vdarulis
Copy link
Collaborator

@vdarulis vdarulis commented Feb 9, 2021

What this PR does / why we need it:

Turns out Go was unable to inline most of the comparison logic, adding function call and copy overhead for metadata:

name                  old time/op    new time/op    delta
AggregationValues-12     105ns ± 0%      43ns ± 1%  -58.70%  (p=0.000 n=8+8)

Special notes for your reviewer:

Does this PR introduce a user-facing and/or backwards incompatible change?:


Does this PR require updating code package or user-facing documentation?:


if val.key.Equal(k) {
// keep in sync with aggregationKey.Equal()
// this is >2x slower if not inlined manually.
for i := range vals {
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Hmm dunno if this is possible, but any way to add a fuzz test comparing behavior using equals vs using the manual inline here? Less to test the current version of the code than to ensure against future regressions haha.

Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Also, maybe worth adding a pointer from Equal to here to make sure anyone changing that method also changes this one?

Makes one wish for macros...

Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

good point as I was just lazy, but then again I missed something in tests :D

for i, k := range agg.byKey {
if k.key.Equal(key) {
for i := range agg.byKey {
if agg.byKey[i].key.Equal(key) {
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Dumb question: this is faster? I'm surprised haha--more inlining issues?

Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

stack copies due to how range works

Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Ah nice, TIL.

if u.Type != other.Type {
return false
}
switch u.Type {
case pipeline.TransformationOpType:
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

what about this case?

Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

The definition is type TransformationOp struct{Type transformation.Type}, where transformation.Type is plain int

case pipeline.RollupOpType:
clone := OpUnion{
Type: u.Type,
Transformation: u.Transformation,
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

does this need a clone as well? if so, two ifs is probably going to put you back in switch land branch wise

Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

nope, copying an int > copying the same single int conditionally

}

if p.operations[i].Type == pipeline.RollupOpType &&
!p.operations[i].Rollup.Equal(other.operations[i].Rollup) {
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

do we need to worry about the transform case?

Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

yes, my bad, missed it

@codecov
Copy link

codecov bot commented Feb 9, 2021

Codecov Report

Merging #3195 (8bd04ea) into master (027b66b) will decrease coverage by 0.0%.
The diff coverage is 30.7%.

Impacted file tree graph

@@            Coverage Diff            @@
##           master    #3195     +/-   ##
=========================================
- Coverage    72.3%    72.3%   -0.1%     
=========================================
  Files        1087     1087             
  Lines      100729   100736      +7     
=========================================
- Hits        72875    72867      -8     
- Misses      22798    22807      +9     
- Partials     5056     5062      +6     
Flag Coverage Δ
aggregator 75.9% <100.0%> (-0.1%) ⬇️
cluster 85.0% <ø> (ø)
collector 84.3% <ø> (ø)
dbnode 78.7% <ø> (-0.1%) ⬇️
m3em 74.4% <ø> (ø)
m3ninx 73.2% <ø> (-0.1%) ⬇️
metrics 20.0% <0.0%> (-0.1%) ⬇️
msg 74.2% <ø> (+<0.1%) ⬆️
query 67.2% <ø> (ø)
x 80.2% <ø> (-0.2%) ⬇️

Flags with carried forward coverage won't be shown. Click here to find out more.


Continue to review full report at Codecov.

Legend - Click here to learn more
Δ = absolute <relative> (impact), ø = not affected, ? = missing data
Powered by Codecov. Last update 027b66b...8bd04ea. Read the comment docs.

@vdarulis vdarulis merged commit 9e233fe into master Feb 9, 2021
@vdarulis vdarulis deleted the v/agg1 branch February 9, 2021 03:46
soundvibe added a commit that referenced this pull request Feb 10, 2021
* master: (30 commits)
  [dbnode] Use go context to cancel index query workers after timeout (#3194)
  [aggregator] Fix change ActivePlacement semantics on close (#3201)
  [aggregator] Simplify (Active)StagedPlacement API (#3199)
  [aggregator] Checking if metadata is set to default should not cause copying (#3198)
  [dbnode] Remove readers and writer from aggregator API (#3122)
  [aggregator] Avoid large copies in entry rollup comparisons by making them more inline-friendly (#3195)
  [dbnode] Re-add aggregator doc limit update (#3137)
  [m3db] Do not close reader in filterFieldsIterator.Close() (#3196)
  Revert "Remove disk series read limit (#3174)" (#3193)
  [instrument] Improve sampled timer and stopwatch performance (#3191)
  Omit unset fields in metadata json (#3189)
  [dbnode] Remove left-over code in storage/bootstrap/bootstrapper (#3190)
  [dbnode][coordinator] Support match[] in label endpoints (#3180)
  Instrument the worker pool with the wait time (#3188)
  Instrument query path (#3182)
  [aggregator] Remove indirection, large copy from unaggregated protobuf decoder (#3186)
  [aggregator] Sample timers completely (#3184)
  [aggregator] Reduce error handling overhead in rawtcp server (#3183)
  [aggregator] Move shardID calculation out of critical section (#3179)
  Move instrumentation cleanup to FetchTaggedResultIterator Close() (#3173)
  ...
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants