Add constrained scheduler benchmarks#737
Closed
aaronlehmann wants to merge 1 commit into
Closed
Conversation
20ab8b6 to
37ddaaa
Compare
This benchmarks scheduling with constraints, where only 1% of the nodes are eligible to run the tasks. Under the current implementation, this converges towards the worst-case linear behavior, because the few nodes that meet the constraints end up at the end of the heap, and findMin has to scan nearly the whole heap to find them. Signed-off-by: Aaron Lehmann <aaron.lehmann@docker.com>
37ddaaa to
f02d936
Compare
Current coverage is 54.50%
@@ master #737 diff @@
==========================================
Files 78 78
Lines 11156 11158 +2
Methods 0 0
Messages 0 0
Branches 0 0
==========================================
- Hits 6084 6081 -3
- Misses 4233 4242 +9
+ Partials 839 835 -4
|
Collaborator
Author
|
Replaced by #1028. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This benchmarks scheduling with constraints, where only 1% of the nodes
are eligible to run the tasks.
Under the current implementation, this converges towards the worst-case
linear behavior, because the few nodes that meet the constraints end up
at the end of the heap, and findMin has to scan nearly the whole heap to
find them.
cc @runshenzhu
Depends on docker/go-events#11