Package org.apache.hadoop.mapred.FakeObjectUtilities

Examples of org.apache.hadoop.mapred.FakeObjectUtilities.FakeJobInProgress.findReduceTask()

443
444
445
446
447
448
449
450
451
452
453
    job.finishTask(taskAttemptID[2]);
    job.finishTask(taskAttemptID[3]);

    taskAttemptID[4] = job.findReduceTask(trackers[0]);
    taskAttemptID[5] = job.findReduceTask(trackers[1]);
    taskAttemptID[6] = job.findReduceTask(trackers[2]);

    clock.advanceBySpeculativeLag();
    job.finishTask(taskAttemptID[4]);
    job.finishTask(taskAttemptID[5]);
View Full Code Here
451
452
453
454
455
456
457
458
459
460
461
    job.finishTask(taskAttemptID[4]);
    job.finishTask(taskAttemptID[5]);

    // Speculative last unfinised task
    job.refresh(clock.getTime());
    taskAttemptID[7] = job.findReduceTask(trackers[3]);
    Assert.assertNotNull(taskAttemptID[7]);

    job.finishTask(taskAttemptID[6]);
    job.finishTask(taskAttemptID[7]);
  }
View Full Code Here
504
505
506
507
508
509
510
511
512
513
514
    conf.setBoolean("mapreduce.job.speculative.using.processing.rate", true);
    FakeJobInProgress job = new FakeJobInProgress(conf, jobTracker);
    job.initTasks();

    //schedule reduces
    taskAttemptID[0] = job.findReduceTask(trackers[0]);
    taskAttemptID[1] = job.findReduceTask(trackers[1]);
    taskAttemptID[2] = job.findReduceTask(trackers[2]);
    taskAttemptID[3] = job.findReduceTask(trackers[3]);

    clock.advance(1000);
View Full Code Here
505
506
507
508
509
510
511
512
513
514
515
    FakeJobInProgress job = new FakeJobInProgress(conf, jobTracker);
    job.initTasks();

    //schedule reduces
    taskAttemptID[0] = job.findReduceTask(trackers[0]);
    taskAttemptID[1] = job.findReduceTask(trackers[1]);
    taskAttemptID[2] = job.findReduceTask(trackers[2]);
    taskAttemptID[3] = job.findReduceTask(trackers[3]);

    clock.advance(1000);
View Full Code Here
506
507
508
509
510
511
512
513
514
515
516
    job.initTasks();

    //schedule reduces
    taskAttemptID[0] = job.findReduceTask(trackers[0]);
    taskAttemptID[1] = job.findReduceTask(trackers[1]);
    taskAttemptID[2] = job.findReduceTask(trackers[2]);
    taskAttemptID[3] = job.findReduceTask(trackers[3]);

    clock.advance(1000);

    //task 0 just starts copying, while task 1, 2, 3 are already in the reducing
View Full Code Here
507
508
509
510
511
512
513
514
515
516
517
    //schedule reduces
    taskAttemptID[0] = job.findReduceTask(trackers[0]);
    taskAttemptID[1] = job.findReduceTask(trackers[1]);
    taskAttemptID[2] = job.findReduceTask(trackers[2]);
    taskAttemptID[3] = job.findReduceTask(trackers[3]);

    clock.advance(1000);

    //task 0 just starts copying, while task 1, 2, 3 are already in the reducing
    //phase. If we compared the progress rate, then we should speculate 0.
View Full Code Here
537
538
539
540
541
542
543
544
545
    job.processingRate(taskAttemptID[3], Task.Counter.REDUCE_INPUT_BYTES,
        100000000, 0.8f, TaskStatus.Phase.REDUCE);
    clock.advanceBySpeculativeLag();
    //we should get a speculative task now
    job.refresh(clock.getTime());
    taskAttemptID[4] = job.findReduceTask(trackers[4]);
    assertEquals(taskAttemptID[4].getTaskID().getId(),1);
  }
}
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.