-
Notifications
You must be signed in to change notification settings - Fork 10
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
Prefer the use of FxHash over Hash #692
Conversation
This commit adjusts more of our codebase to use the FxHash instead of the randomly seeded Hash{Map|Set}. We want to avoid sources of non-determinism. We believe many of our dependencies will use randomly seeded HashMaps and this commit does nothing to address that. REF SMP-687 Signed-off-by: Brian L. Troutwine <[email protected]>
Regression Detector ResultsRun ID: f8e119f4-fbcf-47ac-95b7-eb27e7a8719c ExplanationA regression test is an integrated performance test for Because a target's optimization goal performance in each experiment will vary somewhat each time it is run, we can only estimate mean differences in optimization goal relative to the baseline target. We express these differences as a percentage change relative to the baseline target, denoted "Δ mean %". These estimates are made to a precision that balances accuracy and cost control. We represent this precision as a 90.00% confidence interval denoted "Δ mean % CI": there is a 90.00% chance that the true value of "Δ mean %" is in that interval. We decide whether a change in performance is a "regression" -- a change worth investigating further -- if both of the following two criteria are true:
The table below, if present, lists those experiments that have experienced a statistically significant change in mean optimization goal performance between baseline and comparison SHAs with 90.00% confidence OR have been detected as newly erratic. Negative values of "Δ mean %" mean that baseline is faster, whereas positive values of "Δ mean %" mean that comparison is faster. Results that do not exhibit more than a ±5.00% change in their mean optimization goal are discarded. An experiment is erratic if its coefficient of variation is greater than 0.1. The abbreviated table will be omitted if no interesting change is observed. No interesting changes in experiment optimization goals with confidence ≥ 90.00% and |Δ mean %| ≥ 5.00%. Fine details of change detection per experiment.
|
For this sort of change, I'm wondering if we should be doing another kind of analysis. If we make this change to decrease non-determinism -- which I agree is preferable -- is that decrease something we should be quantifying in some meaningful way? (Decreased variance in throughput? Change in distribution of throughputs?) |
I think this is a really important question and it's not something I have an answer for. But I would like to. |
What does this PR do?
This commit adjusts more of our codebase to use the FxHash instead of the randomly seeded Hash{Map|Set}. We want to avoid sources of non-determinism. We believe many of our dependencies will use randomly seeded HashMaps and this commit does nothing to address that.
Related issues
REF SMP-687