[SERVER-42402] Performance benchmark for refining the shard key of a collection with very many chunks Created: 24/Jul/19 Updated: 11/Nov/19 Resolved: 11/Nov/19 |
|
| Status: | Closed |
| Project: | Core Server |
| Component/s: | Performance, Sharding |
| Affects Version/s: | None |
| Fix Version/s: | None |
| Type: | Task | Priority: | Major - P3 |
| Reporter: | Jack Mulrow | Assignee: | Blake Oler |
| Resolution: | Done | Votes: | 0 |
| Labels: | None | ||
| Remaining Estimate: | Not Specified | ||
| Time Spent: | Not Specified | ||
| Original Estimate: | Not Specified | ||
| Attachments: |
|
||||||||
| Issue Links: |
|
||||||||
| Sprint: | Sharding 2019-09-09, Sharding 2019-09-23, Sharding 2019-10-07, Sharding 2019-10-21, Sharding 2019-11-04, Sharding 2019-11-18 | ||||||||
| Participants: | |||||||||
| Description |
|
From the design document: A sysperf benchmark should be made that actually refines the shard key for a collection with a huge number of chunks to uncover any unforeseen performance problems. This benchmark will serve mostly as a sanity check and should only be added as a permanent benchmark if it is found to add valuable enough performance coverage beyond the coverage from the benchmark in |
| Comments |
| Comment by Blake Oler [ 11/Nov/19 ] |
|
Verified via local testing that the time taken for refining a shard key is linear with the amount of chunks. Chart is in the attached file. Closing this ticket as Done. |