YARN-5453. FairScheduler#update may skip update demand resource of child queue/app if current demand reached maxResource. (sandflee via kasha)
(cherry picked from commit 86ac1ad9fd
)
This commit is contained in:
parent
06c8ebdb83
commit
f7b25420a1
|
@ -268,20 +268,16 @@ public class FSLeafQueue extends FSQueue {
|
|||
readLock.lock();
|
||||
try {
|
||||
for (FSAppAttempt sched : runnableApps) {
|
||||
if (Resources.equals(demand, maxShare)) {
|
||||
break;
|
||||
}
|
||||
updateDemandForApp(sched, maxShare);
|
||||
updateDemandForApp(sched);
|
||||
}
|
||||
for (FSAppAttempt sched : nonRunnableApps) {
|
||||
if (Resources.equals(demand, maxShare)) {
|
||||
break;
|
||||
}
|
||||
updateDemandForApp(sched, maxShare);
|
||||
updateDemandForApp(sched);
|
||||
}
|
||||
} finally {
|
||||
readLock.unlock();
|
||||
}
|
||||
// Cap demand to maxShare to limit allocation to maxShare
|
||||
demand = Resources.componentwiseMin(demand, maxShare);
|
||||
if (LOG.isDebugEnabled()) {
|
||||
LOG.debug("The updated demand for " + getName() + " is " + demand
|
||||
+ "; the max is " + maxShare);
|
||||
|
@ -290,7 +286,7 @@ public class FSLeafQueue extends FSQueue {
|
|||
}
|
||||
}
|
||||
|
||||
private void updateDemandForApp(FSAppAttempt sched, Resource maxRes) {
|
||||
private void updateDemandForApp(FSAppAttempt sched) {
|
||||
sched.updateDemand();
|
||||
Resource toAdd = sched.getDemand();
|
||||
if (LOG.isDebugEnabled()) {
|
||||
|
@ -299,7 +295,6 @@ public class FSLeafQueue extends FSQueue {
|
|||
+ demand);
|
||||
}
|
||||
demand = Resources.add(demand, toAdd);
|
||||
demand = Resources.componentwiseMin(demand, maxRes);
|
||||
}
|
||||
|
||||
@Override
|
||||
|
|
|
@ -159,16 +159,14 @@ public class FSParentQueue extends FSQueue {
|
|||
childQueue.updateDemand();
|
||||
Resource toAdd = childQueue.getDemand();
|
||||
demand = Resources.add(demand, toAdd);
|
||||
demand = Resources.componentwiseMin(demand, maxShare);
|
||||
if (LOG.isDebugEnabled()) {
|
||||
LOG.debug("Counting resource from " + childQueue.getName() + " " +
|
||||
toAdd + "; Total resource demand for " + getName() +
|
||||
" now " + demand);
|
||||
}
|
||||
if (Resources.equals(demand, maxShare)) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
// Cap demand to maxShare to limit allocation to maxShare
|
||||
demand = Resources.componentwiseMin(demand, maxShare);
|
||||
} finally {
|
||||
writeLock.unlock();
|
||||
}
|
||||
|
|
|
@ -4813,4 +4813,45 @@ public class TestFairScheduler extends FairSchedulerTestBase {
|
|||
assertEquals(0, metrics.getReservedMB());
|
||||
assertEquals(0, metrics.getReservedVirtualCores());
|
||||
}
|
||||
|
||||
|
||||
@Test
|
||||
public void testUpdateDemand() throws IOException {
|
||||
scheduler.init(conf);
|
||||
scheduler.start();
|
||||
scheduler.reinitialize(conf, resourceManager.getRMContext());
|
||||
|
||||
Resource maxResource = Resources.createResource(1024 * 8);
|
||||
|
||||
FSAppAttempt app1 = mock(FSAppAttempt.class);
|
||||
Mockito.when(app1.getDemand()).thenReturn(maxResource);
|
||||
FSAppAttempt app2 = mock(FSAppAttempt.class);
|
||||
Mockito.when(app2.getDemand()).thenReturn(maxResource);
|
||||
|
||||
QueueManager queueManager = scheduler.getQueueManager();
|
||||
FSParentQueue queue1 = queueManager.getParentQueue("queue1", true);
|
||||
|
||||
FSLeafQueue aQueue =
|
||||
new FSLeafQueue("root.queue1.a", scheduler, queue1);
|
||||
aQueue.setMaxShare(maxResource);
|
||||
aQueue.addAppSchedulable(app1);
|
||||
|
||||
FSLeafQueue bQueue =
|
||||
new FSLeafQueue("root.queue1.b", scheduler, queue1);
|
||||
bQueue.setMaxShare(maxResource);
|
||||
bQueue.addAppSchedulable(app2);
|
||||
|
||||
queue1.setMaxShare(maxResource);
|
||||
queue1.addChildQueue(aQueue);
|
||||
queue1.addChildQueue(bQueue);
|
||||
|
||||
queue1.updateDemand();
|
||||
|
||||
assertTrue("Demand is greater than max allowed ",
|
||||
Resources.equals(queue1.getDemand(), maxResource));
|
||||
assertTrue("Demand of child queue not updated ",
|
||||
Resources.equals(aQueue.getDemand(), maxResource) &&
|
||||
Resources.equals(bQueue.getDemand(), maxResource));
|
||||
}
|
||||
|
||||
}
|
||||
|
|
Loading…
Reference in New Issue