summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorGreg Studer <greg@10gen.com>2013-02-21 19:27:23 -0500
committerGreg Studer <greg@10gen.com>2013-02-21 19:40:37 -0500
commit420e61e130be8ae5f4d2d283e4f84711121dd8c0 (patch)
tree95cac0f23831ebd420d9ad5a340043acbf48a4bf
parent3aba6f8dc555eafeb9abfdb9fecf2067469fbf1c (diff)
downloadmongo-420e61e130be8ae5f4d2d283e4f84711121dd8c0.tar.gz
buildbot autosplit_heuristics.js add more padding for stochastic retry interval
-rw-r--r--jstests/slowNightly/autosplit_heuristics.js4
1 files changed, 3 insertions, 1 deletions
diff --git a/jstests/slowNightly/autosplit_heuristics.js b/jstests/slowNightly/autosplit_heuristics.js
index 51476a893cc..9015bee42d9 100644
--- a/jstests/slowNightly/autosplit_heuristics.js
+++ b/jstests/slowNightly/autosplit_heuristics.js
@@ -43,7 +43,9 @@ var chunkSizeBytes = 1024 * 1024;
// if resetting the chunk size happens during reloads. If the size is
// reset, we'd expect to split less, since the first split would then
// disable further splits (statistically, since the decision is randomized).
-var insertsForSplit = Math.ceil((chunkSizeBytes * 1.25) / approxSize);
+// We choose 1.4 since split attempts happen about once every 1/5 chunksize,
+// and we want to be sure we def get a split attempt at a full chunk.
+var insertsForSplit = Math.ceil((chunkSizeBytes * 1.4) / approxSize);
var totalInserts = insertsForSplit * numChunks;
printjson({ chunkSizeBytes : chunkSizeBytes,