Java Code Examples for org.apache.hadoop.yarn.server.resourcemanager.scheduler.common.fica.FiCaSchedulerApp#getTotalRequiredResources()

The following examples show how to use org.apache.hadoop.yarn.server.resourcemanager.scheduler.common.fica.FiCaSchedulerApp#getTotalRequiredResources() . You can vote up the ones you like or vote down the ones you don't like, and go to the original project or source file by following the links above each example. You may check out the related API usage on the sidebar.
Example 1
Source File: LeafQueue.java    From hadoop with Apache License 2.0 6 votes vote down vote up 
private synchronized CSAssignment assignReservedContainer(
    FiCaSchedulerApp application, FiCaSchedulerNode node,
    RMContainer rmContainer, Resource clusterResource) {
  // Do we still need this reservation?
  Priority priority = rmContainer.getReservedPriority();
  if (application.getTotalRequiredResources(priority) == 0) {
    // Release
    return new CSAssignment(application, rmContainer);
  }

  // Try to assign if we have sufficient resources
  assignContainersOnNode(clusterResource, node, application, priority, 
      rmContainer, new ResourceLimits(Resources.none()));
  
  // Doesn't matter... since it's already charged for at time of reservation
  // "re-reservation" is *free*
  return new CSAssignment(Resources.none(), NodeType.NODE_LOCAL);
}
Example 2
Source File: LeafQueue.java    From big-c with Apache License 2.0 6 votes vote down vote up 
private synchronized CSAssignment assignReservedContainer(
    FiCaSchedulerApp application, FiCaSchedulerNode node,
    RMContainer rmContainer, Resource clusterResource) {
  // Do we still need this reservation?
  Priority priority = rmContainer.getReservedPriority();
  //优先级是否已经达到要求以分配reservation 的 containers
  if (application.getTotalRequiredResources(priority) == 0) {
    // Release
    return new CSAssignment(application, rmContainer);
  }

  // Try to assign if we have sufficient resources
  assignContainersOnNode(clusterResource, node, application, priority, 
      rmContainer, new ResourceLimits(Resources.none()));
  
  // Doesn't matter... since it's already charged for at time of reservation
  // "re-reservation" is *free*
  return new CSAssignment(Resources.none(), NodeType.NODE_LOCAL);
}
Example 3
Source File: LeafQueue.java    From hadoop with Apache License 2.0 5 votes vote down vote up 
boolean shouldAllocOrReserveNewContainer(FiCaSchedulerApp application,
    Priority priority, Resource required) {
  int requiredContainers = application.getTotalRequiredResources(priority);
  int reservedContainers = application.getNumReservedContainers(priority);
  int starvation = 0;
  if (reservedContainers > 0) {
    float nodeFactor = 
        Resources.ratio(
            resourceCalculator, required, getMaximumAllocation()
            );
    
    // Use percentage of node required to bias against large containers...
    // Protect against corner case where you need the whole node with
    // Math.min(nodeFactor, minimumAllocationFactor)
    starvation = 
        (int)((application.getReReservations(priority) / (float)reservedContainers) * 
              (1.0f - (Math.min(nodeFactor, getMinimumAllocationFactor())))
             );
    
    if (LOG.isDebugEnabled()) {
      LOG.debug("needsContainers:" +
          " app.#re-reserve=" + application.getReReservations(priority) + 
          " reserved=" + reservedContainers + 
          " nodeFactor=" + nodeFactor + 
          " minAllocFactor=" + getMinimumAllocationFactor() +
          " starvation=" + starvation);
    }
  }
  return (((starvation + requiredContainers) - reservedContainers) > 0);
}
Example 4
Source File: LeafQueue.java    From big-c with Apache License 2.0 5 votes vote down vote up 
boolean shouldAllocOrReserveNewContainer(FiCaSchedulerApp application,
    Priority priority, Resource required) {
  int requiredContainers = application.getTotalRequiredResources(priority);
  int reservedContainers = application.getNumReservedContainers(priority);
  int starvation = 0;
  if (reservedContainers > 0) {
    float nodeFactor = 
        Resources.ratio(
            resourceCalculator, required, getMaximumAllocation()
            );
    
    // Use percentage of node required to bias against large containers...
    // Protect against corner case where you need the whole node with
    // Math.min(nodeFactor, minimumAllocationFactor)
    // 在该优先级reserve被call的次数。
    starvation = 
        (int)((application.getReReservations(priority) / (float)reservedContainers) * 
              (1.0f - (Math.min(nodeFactor, getMinimumAllocationFactor())))
             );
    
    if (LOG.isDebugEnabled()) {
      LOG.debug("needsContainers:" +
          " app.#re-reserve=" + application.getReReservations(priority) + 
          " reserved=" + reservedContainers + 
          " nodeFactor=" + nodeFactor + 
          " minAllocFactor=" + getMinimumAllocationFactor() +
          " starvation=" + starvation);
    }
  }

  return (((starvation + requiredContainers) - reservedContainers) > 0);
}