EDFScheduler.java

/**
 * Copyright (c) 2004-2025 Carnegie Mellon University and others. (see Contributors file). 
 * All Rights Reserved.
 * 
 * NO WARRANTY. ALL MATERIAL IS FURNISHED ON AN "AS-IS" BASIS. CARNEGIE MELLON UNIVERSITY MAKES NO WARRANTIES OF ANY
 * KIND, EITHER EXPRESSED OR IMPLIED, AS TO ANY MATTER INCLUDING, BUT NOT LIMITED TO, WARRANTY OF FITNESS FOR PURPOSE
 * OR MERCHANTABILITY, EXCLUSIVITY, OR RESULTS OBTAINED FROM USE OF THE MATERIAL. CARNEGIE MELLON UNIVERSITY DOES NOT
 * MAKE ANY WARRANTY OF ANY KIND WITH RESPECT TO FREEDOM FROM PATENT, TRADEMARK, OR COPYRIGHT INFRINGEMENT.
 * 
 * This program and the accompanying materials are made available under the terms of the Eclipse Public License 2.0
 * which is available at https://www.eclipse.org/legal/epl-2.0/
 * SPDX-License-Identifier: EPL-2.0
 * 
 * Created, in part, with funding and support from the United States Government. (see Acknowledgments file).
 * 
 * This program includes and/or can make use of certain third party source code, object code, documentation and other
 * files ("Third Party Software"). The Third Party Software that is used by this program is dependent upon your system
 * configuration. By using this program, You agree to comply with any and all relevant Third Party Software terms and
 * conditions contained in any such Third Party Software or separate license file distributed with such Third Party
 * Software. The parties who own the Third Party Software ("Third Party Licensors") are intended third party benefici-
 * aries to this license with respect to the terms applicable to their Third Party Software. Third Party Software li-
 * censes only apply to the Third Party Software and not any other portion of this program or this program as a whole.
 */
package EAnalysis.BinPacking;

import java.util.Comparator;
import java.util.Iterator;
import java.util.TreeSet;

public class EDFScheduler extends BaseScheduler {
	TreeSet taskSet;

	double currentCapacity = 0;

	long currentLoadCyclesPerSecond = 0;

	protected HardwareNode node;

	public void setHardwareNode(HardwareNode n) {
		node = n;
	}

	public HardwareNode getHardwareNode() {
		return node;
	}

	/**
	 * Capacity used by the tasks set
	 */
	protected int usedCapacity;

	public TreeSet getTaskSet() {
		return taskSet;
	}

	public boolean canAddToFeasibility(ProcessingLoad n) {
		return ((currentCapacity + n.getBandwidth() / node.getCyclesPerSecond()) <= 1.0);
	}

	public boolean addIfFeasible(ProcessingLoad n) {
		if ((currentCapacity + n.getBandwidth() / node.getCyclesPerSecond()) <= 1.0) {
			// long potentialLoad = 0;
			// potentialLoad += node.cyclesPerSecond;
			// potentialLoad -= currentLoadCyclesPerSecond;
			// potentialLoad -= n.getCyclesPerSecond();

			// if (potentialLoad>=0)
			// {
			taskSet.add(n);
			currentCapacity += n.getBandwidth() / node.getCyclesPerSecond();
			currentLoadCyclesPerSecond += n.getCyclesPerSecond();
			n.setDeployedTo(getHardwareNode());
			return true;
		} else {
			// System.out.println("addIfFeasible failed:");
			// System.out.println("\t
			// node.cyclesPerSec("+node.cyclesPerSecond+")");
			// System.out.println("\t module.bandwidth("+n.getBandwidth()+")");
			// System.out.println("\t\t bw/cyclesPerSec ("+ (n.getBandwidth()/
			// node.cyclesPerSecond)+")");
			// System.out.println("\t currentCapacity("+currentCapacity+")");
		}
		return false;
	}

	public void removeFromFeasibleSet(ProcessingLoad n) {
		if (taskSet.contains(n)) {
			taskSet.remove(n);
			n.setDeployedTo(null);
			currentCapacity -= n.getBandwidth() / node.getCyclesPerSecond();
			currentLoadCyclesPerSecond -= n.getCyclesPerSecond();
		}
	}

	public double getAvailableCapacity() {
		return (1.0 - currentCapacity);
	}

	public long getAvailableCyclesPerSecond() {
		return ((long) node.getCyclesPerSecond()) - currentLoadCyclesPerSecond;
	}

	/**
	 * calculate whether the task set is schedulable or not
	 * 
	 * @param taskSet
	 *            task set ordered by non-decreasing order of deadline
	 */

	public boolean isSchedulable(TreeSet tSet) {
		double capacity = 0.0;
		// long capacity =0;
		for (Iterator iter = tSet.iterator(); iter.hasNext();) {
			SoftwareNode n = (SoftwareNode) iter.next();
			// capacity += n.getCyclesPerSecond();
			capacity += n.getBandwidth() / node.getCyclesPerSecond();
			if (capacity > 1.0) // node.cyclesPerSecond)
				return false;
		}
		return true;
	}

	public EDFScheduler() {
	}

	public void cloneTo(Scheduler from, Scheduler to) {
		((EDFScheduler) to).taskSet = new TreeSet(((EDFScheduler) from).taskSet.comparator());
	}

	public EDFScheduler(Comparator comparator) {
		taskSet = new TreeSet(comparator);
	}
}