Java LeafQueue.getPreemptionDisabled方法代码示例

import org.apache.hadoop.yarn.server.resourcemanager.scheduler.capacity.LeafQueue; //导入方法依赖的package包/类
CapacitySchedulerLeafQueueInfo(LeafQueue q) {
  super(q);
  numActiveApplications = q.getNumActiveApplications();
  numPendingApplications = q.getNumPendingApplications();
  numContainers = q.getNumContainers();
  maxApplications = q.getMaxApplications();
  maxApplicationsPerUser = q.getMaxApplicationsPerUser();
  userLimit = q.getUserLimit();
  users = new UsersInfo(q.getUsers());
  userLimitFactor = q.getUserLimitFactor();
  AMResourceLimit = new ResourceInfo(q.getAMResourceLimit());
  usedAMResource = new ResourceInfo(q.getQueueResourceUsage().getAMUsed());
  userAMResourceLimit = new ResourceInfo(q.getUserAMResourceLimit());
  preemptionDisabled = q.getPreemptionDisabled();
  orderingPolicyInfo = q.getOrderingPolicy().getInfo();
  defaultNodeLabelExpression = q.getDefaultNodeLabelExpression();
  defaultPriority = q.getDefaultApplicationPriority().getPriority();
}
 

import org.apache.hadoop.yarn.server.resourcemanager.scheduler.capacity.LeafQueue; //导入方法依赖的package包/类
CapacitySchedulerLeafQueueInfo(LeafQueue q, String nodeLabel) {
  super(q, nodeLabel);
  numActiveApplications = q.getNumActiveApplications();
  numPendingApplications = q.getNumPendingApplications();
  numContainers = q.getNumContainers();
  maxApplications = q.getMaxApplications();
  maxApplicationsPerUser = q.getMaxApplicationsPerUser();
  userLimit = q.getUserLimit();
  users = new UsersInfo(q.getUsers());
  userLimitFactor = q.getUserLimitFactor();
  AMResourceLimit = new ResourceInfo(q.getAMResourceLimit());
  usedAMResource = new ResourceInfo(q.getQueueResourceUsage().getAMUsed());
  userAMResourceLimit = new ResourceInfo(q.getUserAMResourceLimit());
  preemptionDisabled = q.getPreemptionDisabled();
}
 

import org.apache.hadoop.yarn.server.resourcemanager.scheduler.capacity.LeafQueue; //导入方法依赖的package包/类
CapacitySchedulerLeafQueueInfo(LeafQueue q) {
  super(q);
  numActiveApplications = q.getNumActiveApplications();
  numPendingApplications = q.getNumPendingApplications();
  numContainers = q.getNumContainers();
  maxApplications = q.getMaxApplications();
  maxApplicationsPerUser = q.getMaxApplicationsPerUser();
  userLimit = q.getUserLimit();
  users = new UsersInfo(q.getUsers());
  userLimitFactor = q.getUserLimitFactor();
  AMResourceLimit = new ResourceInfo(q.getAMResourceLimit());
  usedAMResource = new ResourceInfo(q.getQueueResourceUsage().getAMUsed());
  userAMResourceLimit = new ResourceInfo(q.getUserAMResourceLimit());
  preemptionDisabled = q.getPreemptionDisabled();
}
 

import org.apache.hadoop.yarn.server.resourcemanager.scheduler.capacity.LeafQueue; //导入方法依赖的package包/类
CapacitySchedulerLeafQueueInfo(LeafQueue q) {
  super(q);
  numActiveApplications = q.getNumActiveApplications();
  numPendingApplications = q.getNumPendingApplications();
  numContainers = q.getNumContainers();
  maxApplications = q.getMaxApplications();
  maxApplicationsPerUser = q.getMaxApplicationsPerUser();
  userLimit = q.getUserLimit();
  users = new UsersInfo(q.getUsers());
  userLimitFactor = q.getUserLimitFactor();
  AMResourceLimit = new ResourceInfo(q.getAMResourceLimit());
  usedAMResource = new ResourceInfo(q.getQueueResourceUsage().getAMUsed());
  preemptionDisabled = q.getPreemptionDisabled();
  orderingPolicyInfo = q.getOrderingPolicy().getInfo();
  defaultNodeLabelExpression = q.getDefaultNodeLabelExpression();
  defaultPriority = q.getDefaultApplicationPriority().getPriority();
  ArrayList<UserInfo> usersList = users.getUsersList();
  if (usersList.isEmpty()) {
    // If no users are present, consider AM Limit for that queue.
    userAMResourceLimit = resources.getPartitionResourceUsageInfo(
        RMNodeLabelsManager.NO_LABEL).getAMLimit();
  } else {
    userAMResourceLimit = usersList.get(0).getResourceUsageInfo()
        .getPartitionResourceUsageInfo(RMNodeLabelsManager.NO_LABEL)
        .getAMLimit();
  }
}
 

import org.apache.hadoop.yarn.server.resourcemanager.scheduler.capacity.LeafQueue; //导入方法依赖的package包/类
@Override
public Map<ApplicationAttemptId, Set<RMContainer>> selectCandidates(
    Map<ApplicationAttemptId, Set<RMContainer>> selectedCandidates,
    Resource clusterResource, Resource totalPreemptedResourceAllowed) {

  // 1. Calculate the abnormality within each queue one by one.
  computeIntraQueuePreemptionDemand(
      clusterResource, totalPreemptedResourceAllowed, selectedCandidates);

  // 2. Previous selectors (with higher priority) could have already
  // selected containers. We need to deduct pre-emptable resources
  // based on already selected candidates.
  CapacitySchedulerPreemptionUtils
      .deductPreemptableResourcesBasedSelectedCandidates(preemptionContext,
          selectedCandidates);

  // 3. Loop through all partitions to select containers for preemption.
  for (String partition : preemptionContext.getAllPartitions()) {
    LinkedHashSet<String> queueNames = preemptionContext
        .getUnderServedQueuesPerPartition(partition);

    // Error check to handle non-mapped labels to queue.
    if (null == queueNames) {
      continue;
    }

    // 4. Iterate from most under-served queue in order.
    for (String queueName : queueNames) {
      LeafQueue leafQueue = preemptionContext.getQueueByPartition(queueName,
          RMNodeLabelsManager.NO_LABEL).leafQueue;

      // skip if not a leafqueue
      if (null == leafQueue) {
        continue;
      }

      // Don't preempt if disabled for this queue.
      if (leafQueue.getPreemptionDisabled()) {
        continue;
      }

      // 5. Calculate the resource to obtain per partition
      Map<String, Resource> resToObtainByPartition = fifoPreemptionComputePlugin
          .getResourceDemandFromAppsPerQueue(queueName, partition);

      // 6. Based on the selected resource demand per partition, select
      // containers with known policy from inter-queue preemption.
      synchronized (leafQueue) {
        Iterator<FiCaSchedulerApp> desc = leafQueue.getOrderingPolicy()
            .getPreemptionIterator();
        while (desc.hasNext()) {
          FiCaSchedulerApp app = desc.next();
          preemptFromLeastStarvedApp(selectedCandidates, clusterResource,
              totalPreemptedResourceAllowed, resToObtainByPartition,
              leafQueue, app);
        }
      }
    }
  }

  return selectedCandidates;
}