Skip to content

Commit

Permalink
spelling: would
Browse files Browse the repository at this point in the history
Signed-off-by: Josh Soref <2119212+jsoref@users.noreply.github.com>
  • Loading branch information
jsoref committed Mar 21, 2024
1 parent 56af2c0 commit bebac83
Show file tree
Hide file tree
Showing 2 changed files with 2 additions and 2 deletions.
2 changes: 1 addition & 1 deletion design/tlog-spilling.md.html
Expand Up @@ -571,7 +571,7 @@

If this turns out to be an issue, it's trivial to address. There's no
reason to do only a binary search when drives support parallel requests. A
32-way search could reasonably be done, and would would make a 4TB Disk
32-way search could reasonably be done, and would make a 4TB Disk
Queue file faster to recover than a 4GB one currently.

3. Disk queue files can now shrink.
Expand Down
2 changes: 1 addition & 1 deletion fdbserver/include/fdbserver/MovingWindow.h
Expand Up @@ -33,7 +33,7 @@
// want to get the actual average bytes moved rate by DD in the past DD_TRACE_MOVE_BYTES_AVERAGE_INTERVAL. We would have
// a sense of how many bytes DD moved recently and it will help us get to know DD workload.
// Comparison with Smoother: if you want to use a recency-based weighting(i.e. less important if sampled long time ago)
// Smoother(which uses an exponential function for smoothing) woule be a good choice. On the other hand, if you want to
// Smoother(which uses an exponential function for smoothing) would be a good choice. On the other hand, if you want to
// know the average sample rates in the last <timeWindow>, MovingWindow might be better.

template <class T>
Expand Down

0 comments on commit bebac83

Please sign in to comment.