-
Notifications
You must be signed in to change notification settings - Fork 72
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
dynamic delay: fix pending bytes rate calculation #451
Conversation
db/column_family.cc
Outdated
} | ||
uint64_t step_size = ceil(soft_hard_range / kNumPendingSteps); | ||
uint64_t extra_bytes = compaction_needed_bytes - soft_limit; | ||
assert(extra_bytes > 0); |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I think this condition is always true
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
you're right, useless assert indeed. i'll remove it
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
removed. plz reapprove @RoyBenMoshe
3e68c7e
to
54eac36
Compare
54eac36
to
01dc130
Compare
use fixed num delay steps instead of fixing the step size and deducing the num steps. this makes the code simpler and avoids a bug when the excess bytes are greater than num_steps * step_size which then fails the assert: assert(step_num < num_steps); - since step_num == num_steps.
01dc130
to
af39610
Compare
@RoyBenMoshe one last time (hopefully) |
passed performance tests - large obj and small db with single disk both. no degradation |
use fixed num delay steps instead of fixing the step size and deducing the num steps. this makes the code simpler and avoids a bug when the excess bytes are greater than num_steps * step_size which then fails the assert: assert(step_num < num_steps); - since step_num == num_steps.
use fixed num delay steps instead of fixing the step size and deducing the num steps. this makes the code simpler and avoids a bug when the excess bytes are greater than num_steps * step_size which then fails the assert: assert(step_num < num_steps); - since step_num == num_steps.
use fixed num delay steps instead of fixing the step size and deducing the num steps. this makes the code simpler and avoids a bug when the excess bytes are greater than num_steps * step_size which then fails the assert: assert(step_num < num_steps); - since step_num == num_steps.
use fixed num delay steps instead of fixing the step size and deducing the num steps. this makes the code simpler and avoids a bug when the excess bytes are greater than num_steps * step_size which then fails the assert: assert(step_num < num_steps); - since step_num == num_steps.
use fixed num delay steps instead of fixing the step size and deducing the num steps. this makes the code simpler and avoids a bug when the excess bytes are greater than num_steps * step_size which then fails the assert: assert(step_num < num_steps); - since step_num == num_steps.
closes #431
use fixed num delay steps instead of fixing the step size and deducing the num steps.
this makes the code simpler and avoids a bug when the excess bytes are greater than num_steps * step_size which then fails the assert: assert(step_num < num_steps); - since step_num == num_steps.