summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorShayne Wang <shaynewang@users.noreply.github.com>2017-02-15 22:01:13 -0800
committerGitHub <noreply@github.com>2017-02-15 22:01:13 -0800
commit19341be4ee0dfbf9327292a62f657b6be949b46b (patch)
tree138767881f57bddc2c54dbafdb048a86d315fac2
parent0fd8617138c0a9f3f23f6224cc8872ce74cbe317 (diff)
Fixed broken link to generic_scheduler.go
404 Error because file was moved from plugin/pkg/scheduler/generic_scheduler.go to plugin/pkg/scheduler/core/generic_scheduler.go change was made correspond to that change
-rwxr-xr-xcontributors/devel/scheduler.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/contributors/devel/scheduler.md b/contributors/devel/scheduler.md
index 9230535e..ae1bc68f 100755
--- a/contributors/devel/scheduler.md
+++ b/contributors/devel/scheduler.md
@@ -64,7 +64,7 @@ The Scheduler tries to find a node for each Pod, one at a time.
- First it applies a set of "predicates" to filter out inappropriate nodes. For example, if the PodSpec specifies resource requests, then the scheduler will filter out nodes that don't have at least that much resources available (computed as the capacity of the node minus the sum of the resource requests of the containers that are already running on the node).
- Second, it applies a set of "priority functions"
that rank the nodes that weren't filtered out by the predicate check. For example, it tries to spread Pods across nodes and zones while at the same time favoring the least (theoretically) loaded nodes (where "load" - in theory - is measured as the sum of the resource requests of the containers running on the node, divided by the node's capacity).
-- Finally, the node with the highest priority is chosen (or, if there are multiple such nodes, then one of them is chosen at random). The code for this main scheduling loop is in the function `Schedule()` in [plugin/pkg/scheduler/generic_scheduler.go](http://releases.k8s.io/HEAD/plugin/pkg/scheduler/generic_scheduler.go)
+- Finally, the node with the highest priority is chosen (or, if there are multiple such nodes, then one of them is chosen at random). The code for this main scheduling loop is in the function `Schedule()` in [plugin/pkg/scheduler/generic_scheduler.go](http://releases.k8s.io/HEAD/plugin/pkg/scheduler/core/generic_scheduler.go)
### Predicates and priorities policies