WorkflowSim HEFT 代码注解

/**
 * Copyright 2012-2013 University Of Southern California
 *
 * Licensed under the Apache License, Version 2.0 (the "License"); you may not
 * use this file except in compliance with the License. You may obtain a copy of
 * the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
 * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
 * License for the specific language governing permissions and limitations under
 * the License.
 */
package org.workflowsim.planning;

import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import org.cloudbus.cloudsim.Consts;
import org.cloudbus.cloudsim.Log;
import org.workflowsim.CondorVM;
import org.workflowsim.FileItem;
import org.workflowsim.Task;
import org.workflowsim.utils.Parameters;

/**
 * The HEFT planning algorithm.
 *
 * @author Pedro Paulo Vezz谩 Campos
 * @date Oct 12, 2013
 */
public class HEFTPlanningAlgorithm extends BasePlanningAlgorithm {
   
   

    private Map<Task, Map<CondorVM, Double>> computationCosts; 
    // 任务Task在某vm上的计算代价时间
    
    private Map<Task, Map<Task, Double>> transferCosts;
    // 任务与任务间的传输代价时间
    
    private Map<Task, Double> rank;
    // 任务的“rank”
    
    private Map<CondorVM, List<Event>> schedules;
    // vm上面的调度事件（一个一个的时间片）
   
    private Map<Task, Double> earliestFinishTimes;
    // 任务的最早完成时间EFT
    
    private double averageBandwidth;
    // 平均带宽，此值可用于计算任务到任务的传输代价时间
    
    // vm上的一个调度事件（一个时间片）
    private class Event {
   
   
    	
        public double start;
        public double finish;

        public Event(double start, double finish) {
   
   
            this.start = start;
            this.finish = finish;
        }
    }

    private class TaskRank implements Comparable<TaskRank> {
   
   

        public Task task;
        public Double rank;

        public TaskRank(Task task, Double rank) {
   
   
            this.task = task;
            this.rank = rank;
        }

        @Override
        public int compareTo(TaskRank o) {
   
   
            return o.rank.compareTo(rank);
            // o.rank比rank大时，返回值为1；等：0；小：-1.
        }
    }

    // 五大初始化
    public HEFTPlanningAlgorithm() {
   
   
        computationCosts = new HashMap<>();
        transferCosts = new HashMap<>();
        rank = new HashMap<>();
        earliestFinishTimes = new HashMap<>();
        schedules = new HashMap<>();
    }

    /**
     * The main function
     */
    @Override
    public void run() {