当前位置: 首页>>代码示例>>Java>>正文


Java AllocationConfiguration类代码示例

本文整理汇总了Java中org.apache.hadoop.yarn.server.resourcemanager.scheduler.fair.AllocationConfiguration的典型用法代码示例。如果您正苦于以下问题:Java AllocationConfiguration类的具体用法?Java AllocationConfiguration怎么用?Java AllocationConfiguration使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。


AllocationConfiguration类属于org.apache.hadoop.yarn.server.resourcemanager.scheduler.fair包,在下文中一共展示了AllocationConfiguration类的8个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。

示例1: testEmptyChildQueues

import org.apache.hadoop.yarn.server.resourcemanager.scheduler.fair.AllocationConfiguration; //导入依赖的package包/类
@Test
public void testEmptyChildQueues() throws Exception {
  FairSchedulerConfiguration conf = new FairSchedulerConfiguration();
  FairScheduler scheduler = mock(FairScheduler.class);
  AllocationConfiguration allocConf = new AllocationConfiguration(conf);
  when(scheduler.getAllocationConfiguration()).thenReturn(allocConf);
  when(scheduler.getConf()).thenReturn(conf);
  when(scheduler.getClusterResource()).thenReturn(Resource.newInstance(1, 1));
  SystemClock clock = new SystemClock();
  when(scheduler.getClock()).thenReturn(clock);
  QueueManager queueManager = new QueueManager(scheduler);
  queueManager.initialize(conf);

  FSQueue testQueue = queueManager.getLeafQueue("test", true);
  FairSchedulerQueueInfo queueInfo =
      new FairSchedulerQueueInfo(testQueue, scheduler);
  Collection<FairSchedulerQueueInfo> childQueues =
      queueInfo.getChildQueues();
  Assert.assertNotNull(childQueues);
  Assert.assertEquals("Child QueueInfo was not empty", 0, childQueues.size());
}
 
开发者ID:aliyun-beta,项目名称:aliyun-oss-hadoop-fs,代码行数:22,代码来源:TestFairSchedulerQueueInfo.java

示例2: setupPlanFollower

import org.apache.hadoop.yarn.server.resourcemanager.scheduler.fair.AllocationConfiguration; //导入依赖的package包/类
private void setupPlanFollower() throws Exception {
  ReservationSystemTestUtil testUtil = new ReservationSystemTestUtil();
  mClock = mock(Clock.class);
  mAgent = mock(ReservationAgent.class);

  String reservationQ = testUtil.getFullReservationQueueName();
  AllocationConfiguration allocConf = fs.getAllocationConfiguration();
  allocConf.setReservationWindow(20L);
  allocConf.setAverageCapacity(20);
  policy.init(reservationQ, allocConf);
}
 
开发者ID:naver,项目名称:hadoop,代码行数:12,代码来源:TestFairSchedulerPlanFollower.java

示例3: FairSchedulerQueueInfo

import org.apache.hadoop.yarn.server.resourcemanager.scheduler.fair.AllocationConfiguration; //导入依赖的package包/类
public FairSchedulerQueueInfo(FSQueue queue, FairScheduler scheduler) {
  AllocationConfiguration allocConf = scheduler.getAllocationConfiguration();
  
  queueName = queue.getName();
  schedulingPolicy = queue.getPolicy().getName();
  
  clusterResources = new ResourceInfo(scheduler.getClusterResource());
  
  usedResources = new ResourceInfo(queue.getResourceUsage());
  fractionMemUsed = (float)usedResources.getMemory() /
      clusterResources.getMemory();

  steadyFairResources = new ResourceInfo(queue.getSteadyFairShare());
  fairResources = new ResourceInfo(queue.getFairShare());
  minResources = new ResourceInfo(queue.getMinShare());
  maxResources = new ResourceInfo(queue.getMaxShare());
  maxResources = new ResourceInfo(
      Resources.componentwiseMin(queue.getMaxShare(),
          scheduler.getClusterResource()));

  fractionMemSteadyFairShare =
      (float)steadyFairResources.getMemory() / clusterResources.getMemory();
  fractionMemFairShare = (float) fairResources.getMemory()
      / clusterResources.getMemory();
  fractionMemMinShare = (float)minResources.getMemory() / clusterResources.getMemory();
  fractionMemMaxShare = (float)maxResources.getMemory() / clusterResources.getMemory();
  
  maxApps = allocConf.getQueueMaxApps(queueName);

  pendingContainers = queue.getMetrics().getPendingContainers();
  allocatedContainers = queue.getMetrics().getAllocatedContainers();
  reservedContainers = queue.getMetrics().getReservedContainers();

  if (allocConf.isReservable(queueName) &&
      !allocConf.getShowReservationAsQueues(queueName)) {
    return;
  }

  childQueues = getChildQueues(queue, scheduler);
}
 
开发者ID:aliyun-beta,项目名称:aliyun-oss-hadoop-fs,代码行数:41,代码来源:FairSchedulerQueueInfo.java

示例4: setupPlanFollower

import org.apache.hadoop.yarn.server.resourcemanager.scheduler.fair.AllocationConfiguration; //导入依赖的package包/类
private void setupPlanFollower() throws Exception {
  mClock = mock(Clock.class);
  mAgent = mock(ReservationAgent.class);

  String reservationQ =
      ReservationSystemTestUtil.getFullReservationQueueName();
  AllocationConfiguration allocConf = fs.getAllocationConfiguration();
  allocConf.setReservationWindow(20L);
  allocConf.setAverageCapacity(20);
  policy.init(reservationQ, allocConf);
}
 
开发者ID:aliyun-beta,项目名称:aliyun-oss-hadoop-fs,代码行数:12,代码来源:TestFairSchedulerPlanFollower.java

示例5: FairSchedulerQueueInfo

import org.apache.hadoop.yarn.server.resourcemanager.scheduler.fair.AllocationConfiguration; //导入依赖的package包/类
public FairSchedulerQueueInfo(FSQueue queue, FairScheduler scheduler) {
  AllocationConfiguration allocConf = scheduler.getAllocationConfiguration();
  
  queueName = queue.getName();
  schedulingPolicy = queue.getPolicy().getName();
  
  clusterResources = new ResourceInfo(scheduler.getClusterResource());
  
  usedResources = new ResourceInfo(queue.getResourceUsage());
  fractionMemUsed = (float)usedResources.getMemory() /
      clusterResources.getMemory();

  steadyFairResources = new ResourceInfo(queue.getSteadyFairShare());
  fairResources = new ResourceInfo(queue.getFairShare());
  minResources = new ResourceInfo(queue.getMinShare());
  maxResources = new ResourceInfo(queue.getMaxShare());
  maxResources = new ResourceInfo(
      Resources.componentwiseMin(queue.getMaxShare(),
          scheduler.getClusterResource()));

  fractionMemSteadyFairShare =
      (float)steadyFairResources.getMemory() / clusterResources.getMemory();
  fractionMemFairShare = (float) fairResources.getMemory()
      / clusterResources.getMemory();
  fractionMemMinShare = (float)minResources.getMemory() / clusterResources.getMemory();
  fractionMemMaxShare = (float)maxResources.getMemory() / clusterResources.getMemory();
  
  maxApps = allocConf.getQueueMaxApps(queueName);
  
  Collection<FSQueue> children = queue.getChildQueues();
  childQueues = new ArrayList<FairSchedulerQueueInfo>();
  for (FSQueue child : children) {
    if (child instanceof FSLeafQueue) {
      childQueues.add(new FairSchedulerLeafQueueInfo((FSLeafQueue)child, scheduler));
    } else {
      childQueues.add(new FairSchedulerQueueInfo(child, scheduler));
    }
  }
}
 
开发者ID:Nextzero,项目名称:hadoop-2.6.0-cdh5.4.3,代码行数:40,代码来源:FairSchedulerQueueInfo.java

示例6: FairSchedulerQueueInfo

import org.apache.hadoop.yarn.server.resourcemanager.scheduler.fair.AllocationConfiguration; //导入依赖的package包/类
public FairSchedulerQueueInfo(FSQueue queue, FairScheduler scheduler) {
  AllocationConfiguration allocConf = scheduler.getAllocationConfiguration();
  
  queueName = queue.getName();
  schedulingPolicy = queue.getPolicy().getName();
  
  clusterResources = new ResourceInfo(scheduler.getClusterCapacity());
  
  usedResources = new ResourceInfo(queue.getResourceUsage());
  fractionMemUsed = (float)usedResources.getMemory() /
      clusterResources.getMemory();
  
  fairResources = new ResourceInfo(queue.getFairShare());
  minResources = new ResourceInfo(queue.getMinShare());
  maxResources = new ResourceInfo(queue.getMaxShare());
  maxResources = new ResourceInfo(
      Resources.componentwiseMin(queue.getMaxShare(),
          scheduler.getClusterCapacity()));
  
  fractionMemFairShare = (float)fairResources.getMemory() / clusterResources.getMemory();
  fractionMemMinShare = (float)minResources.getMemory() / clusterResources.getMemory();
  fractionMemMaxShare = (float)maxResources.getMemory() / clusterResources.getMemory();
  
  maxApps = allocConf.getQueueMaxApps(queueName);
  
  Collection<FSQueue> children = queue.getChildQueues();
  childQueues = new ArrayList<FairSchedulerQueueInfo>();
  for (FSQueue child : children) {
    if (child instanceof FSLeafQueue) {
      childQueues.add(new FairSchedulerLeafQueueInfo((FSLeafQueue)child, scheduler));
    } else {
      childQueues.add(new FairSchedulerQueueInfo(child, scheduler));
    }
  }
}
 
开发者ID:Seagate,项目名称:hadoop-on-lustre2,代码行数:36,代码来源:FairSchedulerQueueInfo.java

示例7: FairSchedulerQueueInfo

import org.apache.hadoop.yarn.server.resourcemanager.scheduler.fair.AllocationConfiguration; //导入依赖的package包/类
public FairSchedulerQueueInfo(FSQueue queue, FairScheduler scheduler) {
  AllocationConfiguration allocConf = scheduler.getAllocationConfiguration();
  
  queueName = queue.getName();
  schedulingPolicy = queue.getPolicy().getName();
  
  clusterResources = new ResourceInfo(scheduler.getClusterResource());
  
  usedResources = new ResourceInfo(queue.getResourceUsage());
  fractionMemUsed = (float)usedResources.getMemory() /
      clusterResources.getMemory();

  steadyFairResources = new ResourceInfo(queue.getSteadyFairShare());
  fairResources = new ResourceInfo(queue.getFairShare());
  minResources = new ResourceInfo(queue.getMinShare());
  maxResources = new ResourceInfo(queue.getMaxShare());
  maxResources = new ResourceInfo(
      Resources.componentwiseMin(queue.getMaxShare(),
          scheduler.getClusterResource()));

  fractionMemSteadyFairShare =
      (float)steadyFairResources.getMemory() / clusterResources.getMemory();
  fractionMemFairShare = (float) fairResources.getMemory()
      / clusterResources.getMemory();
  fractionMemMinShare = (float)minResources.getMemory() / clusterResources.getMemory();
  fractionMemMaxShare = (float)maxResources.getMemory() / clusterResources.getMemory();
  
  maxApps = allocConf.getQueueMaxApps(queueName);

  childQueues = new ArrayList<FairSchedulerQueueInfo>();
  if (allocConf.isReservable(queueName) &&
      !allocConf.getShowReservationAsQueues(queueName)) {
    return;
  }

  Collection<FSQueue> children = queue.getChildQueues();
  for (FSQueue child : children) {
    if (child instanceof FSLeafQueue) {
      childQueues.add(new FairSchedulerLeafQueueInfo((FSLeafQueue)child, scheduler));
    } else {
      childQueues.add(new FairSchedulerQueueInfo(child, scheduler));
    }
  }
}
 
开发者ID:naver,项目名称:hadoop,代码行数:45,代码来源:FairSchedulerQueueInfo.java

示例8: FairSchedulerQueueInfo

import org.apache.hadoop.yarn.server.resourcemanager.scheduler.fair.AllocationConfiguration; //导入依赖的package包/类
public FairSchedulerQueueInfo(FSQueue queue, FairScheduler scheduler) {
  AllocationConfiguration allocConf = scheduler.getAllocationConfiguration();
  
  queueName = queue.getName();
  schedulingPolicy = queue.getPolicy().getName();
  
  clusterResources = new ResourceInfo(scheduler.getClusterResource());
  
  usedResources = new ResourceInfo(queue.getResourceUsage());
  demandResources = new ResourceInfo(queue.getDemand());
  fractionMemUsed = (float)usedResources.getMemorySize() /
      clusterResources.getMemorySize();

  steadyFairResources = new ResourceInfo(queue.getSteadyFairShare());
  fairResources = new ResourceInfo(queue.getFairShare());
  minResources = new ResourceInfo(queue.getMinShare());
  maxResources = new ResourceInfo(queue.getMaxShare());
  maxResources = new ResourceInfo(
      Resources.componentwiseMin(queue.getMaxShare(),
          scheduler.getClusterResource()));

  fractionMemSteadyFairShare =
      (float)steadyFairResources.getMemorySize() / clusterResources.getMemorySize();
  fractionMemFairShare = (float) fairResources.getMemorySize()
      / clusterResources.getMemorySize();
  fractionMemMinShare = (float)minResources.getMemorySize() / clusterResources.getMemorySize();
  fractionMemMaxShare = (float)maxResources.getMemorySize() / clusterResources.getMemorySize();
  
  maxApps = allocConf.getQueueMaxApps(queueName);

  pendingContainers = queue.getMetrics().getPendingContainers();
  allocatedContainers = queue.getMetrics().getAllocatedContainers();
  reservedContainers = queue.getMetrics().getReservedContainers();

  if (allocConf.isReservable(queueName) &&
      !allocConf.getShowReservationAsQueues(queueName)) {
    return;
  }

  childQueues = getChildQueues(queue, scheduler);
}
 
开发者ID:hopshadoop,项目名称:hops,代码行数:42,代码来源:FairSchedulerQueueInfo.java


注:本文中的org.apache.hadoop.yarn.server.resourcemanager.scheduler.fair.AllocationConfiguration类示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。