[
https://issues.apache.org/jira/browse/YARN-9278?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Zhaohui Xin updated YARN-9278:
------------------------------
Description:
We should *shuffle* the nodes to avoid some nodes being preempted frequently.
Also, we should *limit* the num of nodes to make preemption more efficient.
Just like this,
{code:java}
// we should not iterate all nodes, that will be very slow
long maxTryNodeNum =
context.getPreemptionConfig().getToBePreemptedNodeMaxNumOnce();
if (potentialNodes.size() > maxTryNodeNum){
Collections.shuffle(potentialNodes);
List<FSSchedulerNode> newPotentialNodes = new ArrayList<FSSchedulerNode>();
for (int i = 0; i < maxTryNodeNum; i++){
newPotentialNodes.add(potentialNodes.get(i));
}
potentialNodes = newPotentialNodes;
{code}
was:We should shuffle the nodes to avoid some nodes being preempted
frequently.
> Shuffle nodes when selecting to be preempted nodes
> --------------------------------------------------
>
> Key: YARN-9278
> URL: https://issues.apache.org/jira/browse/YARN-9278
> Project: Hadoop YARN
> Issue Type: Improvement
> Reporter: Zhaohui Xin
> Assignee: Zhaohui Xin
> Priority: Major
>
> We should *shuffle* the nodes to avoid some nodes being preempted frequently.
> Also, we should *limit* the num of nodes to make preemption more efficient.
> Just like this,
> {code:java}
> // we should not iterate all nodes, that will be very slow
> long maxTryNodeNum =
> context.getPreemptionConfig().getToBePreemptedNodeMaxNumOnce();
> if (potentialNodes.size() > maxTryNodeNum){
> Collections.shuffle(potentialNodes);
> List<FSSchedulerNode> newPotentialNodes = new ArrayList<FSSchedulerNode>();
> for (int i = 0; i < maxTryNodeNum; i++){
> newPotentialNodes.add(potentialNodes.get(i));
> }
> potentialNodes = newPotentialNodes;
> {code}
>
--
This message was sent by Atlassian JIRA
(v7.6.3#76005)
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
