Details
-
Task
-
Status: Patch Available
-
Major
-
Resolution: Unresolved
-
3.3.0
-
None
-
None
-
None
Description
for (String partititon : partitions) { if (current++ > start) { break; } CandidateNodeSet<FiCaSchedulerNode> candidates = cs.getCandidateNodeSet(partititon); if (candidates == null) { continue; } cs.allocateContainersToNode(candidates, false); }
In above logic, if we have thousands of node in one partition, we will still repeatedly access all nodes of the partition thousands of times. There is no break point where if the partition is not same for the first node, it should stop checking other nodes in that partition.