Tabnine Logo
FSQueueMetrics.getFairShareMB
Code IndexAdd Tabnine to your IDE (free)

How to use
getFairShareMB
method
in
org.apache.hadoop.yarn.server.resourcemanager.scheduler.fair.FSQueueMetrics

Best Java code snippets using org.apache.hadoop.yarn.server.resourcemanager.scheduler.fair.FSQueueMetrics.getFairShareMB (Showing top 4 results out of 315)

origin: ch.cern.hadoop/hadoop-yarn-server-resourcemanager

FSLeafQueue queue3 = queueManager.getLeafQueue("parent.queue3", true);
assertEquals(capacity / 2, queue1.getFairShare().getMemory());
assertEquals(capacity / 2, queue1.getMetrics().getFairShareMB());
assertEquals(capacity / 2, queue1.getSteadyFairShare().getMemory());
assertEquals(capacity / 2, queue1.getMetrics().getSteadyFairShareMB());
assertEquals(capacity / 4, queue2.getFairShare().getMemory());
assertEquals(capacity / 4, queue2.getMetrics().getFairShareMB());
assertEquals(capacity / 4, queue2.getSteadyFairShare().getMemory());
assertEquals(capacity / 4, queue2.getMetrics().getSteadyFairShareMB());
assertEquals(capacity / 4, queue3.getFairShare().getMemory());
assertEquals(capacity / 4, queue3.getMetrics().getFairShareMB());
assertEquals(capacity / 4, queue3.getSteadyFairShare().getMemory());
assertEquals(capacity / 4, queue3.getMetrics().getSteadyFairShareMB());
origin: org.apache.hadoop/hadoop-yarn-server-resourcemanager

FSLeafQueue queue3 = queueManager.getLeafQueue("parent.queue3", true);
assertEquals(capacity / 2, queue1.getFairShare().getMemorySize());
assertEquals(capacity / 2, queue1.getMetrics().getFairShareMB());
assertEquals(capacity / 2, queue1.getSteadyFairShare().getMemorySize());
assertEquals(capacity / 2, queue1.getMetrics().getSteadyFairShareMB());
assertEquals(capacity / 4, queue2.getFairShare().getMemorySize());
assertEquals(capacity / 4, queue2.getMetrics().getFairShareMB());
assertEquals(capacity / 4, queue2.getSteadyFairShare().getMemorySize());
assertEquals(capacity / 4, queue2.getMetrics().getSteadyFairShareMB());
assertEquals(capacity / 4, queue3.getFairShare().getMemorySize());
assertEquals(capacity / 4, queue3.getMetrics().getFairShareMB());
assertEquals(capacity / 4, queue3.getSteadyFairShare().getMemorySize());
assertEquals(capacity / 4, queue3.getMetrics().getSteadyFairShareMB());
origin: org.apache.hadoop/hadoop-yarn-server-resourcemanager

@Test
public void testSimpleFairShareCalculation() throws IOException {
 scheduler.init(conf);
 scheduler.start();
 scheduler.reinitialize(conf, resourceManager.getRMContext());
 // Add one big node (only care about aggregate capacity)
 RMNode node1 =
   MockNodes.newNodeInfo(1, Resources.createResource(10 * 1024), 1,
     "127.0.0.1");
 NodeAddedSchedulerEvent nodeEvent1 = new NodeAddedSchedulerEvent(node1);
 scheduler.handle(nodeEvent1);
 // Have two queues which want entire cluster capacity
 createSchedulingRequest(10 * 1024, "queue1", "user1");
 createSchedulingRequest(10 * 1024, "queue2", "user1");
 createSchedulingRequest(10 * 1024, "root.default", "user1");
 scheduler.update();
 scheduler.getQueueManager().getRootQueue()
   .setSteadyFairShare(scheduler.getClusterResource());
 scheduler.getQueueManager().getRootQueue().recomputeSteadyShares();
 Collection<FSLeafQueue> queues = scheduler.getQueueManager().getLeafQueues();
 assertEquals(3, queues.size());
 
 // Divided three ways - between the two queues and the default queue
 for (FSLeafQueue p : queues) {
  assertEquals(3414, p.getFairShare().getMemorySize());
  assertEquals(3414, p.getMetrics().getFairShareMB());
  assertEquals(3414, p.getSteadyFairShare().getMemorySize());
  assertEquals(3414, p.getMetrics().getSteadyFairShareMB());
 }
}
origin: ch.cern.hadoop/hadoop-yarn-server-resourcemanager

@Test
public void testSimpleFairShareCalculation() throws IOException {
 scheduler.init(conf);
 scheduler.start();
 scheduler.reinitialize(conf, resourceManager.getRMContext());
 // Add one big node (only care about aggregate capacity)
 RMNode node1 =
   MockNodes.newNodeInfo(1, Resources.createResource(10 * 1024), 1,
     "127.0.0.1");
 NodeAddedSchedulerEvent nodeEvent1 = new NodeAddedSchedulerEvent(node1);
 scheduler.handle(nodeEvent1);
 // Have two queues which want entire cluster capacity
 createSchedulingRequest(10 * 1024, "queue1", "user1");
 createSchedulingRequest(10 * 1024, "queue2", "user1");
 createSchedulingRequest(10 * 1024, "root.default", "user1");
 scheduler.update();
 scheduler.getQueueManager().getRootQueue()
   .setSteadyFairShare(scheduler.getClusterResource());
 scheduler.getQueueManager().getRootQueue().recomputeSteadyShares();
 Collection<FSLeafQueue> queues = scheduler.getQueueManager().getLeafQueues();
 assertEquals(3, queues.size());
 
 // Divided three ways - between the two queues and the default queue
 for (FSLeafQueue p : queues) {
  assertEquals(3414, p.getFairShare().getMemory());
  assertEquals(3414, p.getMetrics().getFairShareMB());
  assertEquals(3414, p.getSteadyFairShare().getMemory());
  assertEquals(3414, p.getMetrics().getSteadyFairShareMB());
 }
}
org.apache.hadoop.yarn.server.resourcemanager.scheduler.fairFSQueueMetricsgetFairShareMB

Popular methods of FSQueueMetrics

  • forQueue
    Get the FS queue metric for the given queue. Create one and register it to metrics system if there i
  • getAvailableMB
  • getAvailableVirtualCores
  • <init>
  • getAllocatedMB
  • getAllocatedResources
  • getAllocatedVirtualCores
  • getReservedMB
  • setAvailableResourcesToQueue
  • setFairShare
  • setMaxShare
  • setMinShare
  • setMaxShare,
  • setMinShare,
  • setSteadyFairShare,
  • sourceName,
  • submitApp,
  • submitAppAttempt,
  • tag,
  • getAMResourceUsageMB,
  • getAMResourceUsageVCores

Popular in Java

  • Updating database using SQL prepared statement
  • scheduleAtFixedRate (Timer)
  • requestLocationUpdates (LocationManager)
  • setRequestProperty (URLConnection)
  • BufferedWriter (java.io)
    Wraps an existing Writer and buffers the output. Expensive interaction with the underlying reader is
  • FileWriter (java.io)
    A specialized Writer that writes to a file in the file system. All write requests made by calling me
  • Map (java.util)
    A Map is a data structure consisting of a set of keys and values in which each key is mapped to a si
  • SortedSet (java.util)
    SortedSet is a Set which iterates over its elements in a sorted order. The order is determined eithe
  • CountDownLatch (java.util.concurrent)
    A synchronization aid that allows one or more threads to wait until a set of operations being perfor
  • Option (scala)
  • From CI to AI: The AI layer in your organization
Tabnine Logo
  • Products

    Search for Java codeSearch for JavaScript code
  • IDE Plugins

    IntelliJ IDEAWebStormVisual StudioAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimGoLandRubyMineEmacsJupyter NotebookJupyter LabRiderDataGripAppCode
  • Company

    About UsContact UsCareers
  • Resources

    FAQBlogTabnine AcademyTerms of usePrivacy policyJava Code IndexJavascript Code Index
Get Tabnine for your IDE now