Package org.apache.hadoop.mapred.FakeObjectUtilities

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

430
431
432
433
434
435
436
437
438
439
440
    taskAttemptID[0] = job.findMapTask(trackers[0]);
    taskAttemptID[1] = job.findMapTask(trackers[1]);
    taskAttemptID[2] = job.findMapTask(trackers[2]);

    clock.advanceBySpeculativeLag();
    job.finishTask(taskAttemptID[0]);
    job.finishTask(taskAttemptID[1]);

    // Speculative last unfinised task
    job.refresh(clock.getTime());
    taskAttemptID[3] = job.findMapTask(trackers[3]);
View Full Code Here
431
432
433
434
435
436
437
438
439
440
441
    taskAttemptID[1] = job.findMapTask(trackers[1]);
    taskAttemptID[2] = job.findMapTask(trackers[2]);

    clock.advanceBySpeculativeLag();
    job.finishTask(taskAttemptID[0]);
    job.finishTask(taskAttemptID[1]);

    // Speculative last unfinised task
    job.refresh(clock.getTime());
    taskAttemptID[3] = job.findMapTask(trackers[3]);
    Assert.assertNotNull(taskAttemptID[3]);
View Full Code Here
438
439
440
441
442
443
444
445
446
447
448
    // Speculative last unfinised task
    job.refresh(clock.getTime());
    taskAttemptID[3] = job.findMapTask(trackers[3]);
    Assert.assertNotNull(taskAttemptID[3]);

    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]);
View Full Code Here
439
440
441
442
443
444
445
446
447
448
449
    job.refresh(clock.getTime());
    taskAttemptID[3] = job.findMapTask(trackers[3]);
    Assert.assertNotNull(taskAttemptID[3]);

    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]);
View Full Code Here
446
447
448
449
450
451
452
453
454
455
456
    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]);

    // Speculative last unfinised task
    job.refresh(clock.getTime());
    taskAttemptID[7] = job.findReduceTask(trackers[3]);
View Full Code Here
447
448
449
450
451
452
453
454
455
456
457
    taskAttemptID[5] = job.findReduceTask(trackers[1]);
    taskAttemptID[6] = job.findReduceTask(trackers[2]);

    clock.advanceBySpeculativeLag();
    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]);
View Full Code Here
454
455
456
457
458
459
460
461
462
463
464
    // 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]);
  }

  public void testSlowMapProgressingRate() throws IOException {
    clock.advance(1000);
View Full Code Here
455
456
457
458
459
460
461
462
463
464
465
    job.refresh(clock.getTime());
    taskAttemptID[7] = job.findReduceTask(trackers[3]);
    Assert.assertNotNull(taskAttemptID[7]);

    job.finishTask(taskAttemptID[6]);
    job.finishTask(taskAttemptID[7]);
  }

  public void testSlowMapProgressingRate() throws IOException {
    clock.advance(1000);
    TaskAttemptID[] taskAttemptID = new TaskAttemptID[6];
View Full Code Here
476
477
478
479
480
481
482
483
484
485
486
    taskAttemptID[0] = job.findMapTask(trackers[0]);
    taskAttemptID[1] = job.findMapTask(trackers[1]);
    taskAttemptID[2] = job.findMapTask(trackers[2]);

    clock.advance(1000);
    job.finishTask(taskAttemptID[0]);
    //if consider the progress rate, we should speculate task 1
    //but if consider the processing rate, which is map_input_bytes/time
    //then we should speculate task 2
    job.processingRate(taskAttemptID[1], Task.Counter.MAP_INPUT_BYTES,
        100000000, 0.1f, TaskStatus.Phase.MAP);
View Full Code Here
97
98
99
100
101
102
103
104
105
106
107
    taskAttemptID[0] = job.findMapTask(trackers[0]);
    taskAttemptID[1] = job.findMapTask(trackers[1]);
    taskAttemptID[2] = job.findMapTask(trackers[2]);

    clock.advance(5000);
    job.finishTask(taskAttemptID[0]);
    clock.advance(1000);
    job.finishTask(taskAttemptID[1]);
    clock.advanceBySpeculativeLag();

    //we should get a speculative task now
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.