• Home
• net.sf.opendse
• opendse-optimization
• 1.2
• source code
• RedundantCommunicationModifier.java

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

net.sf.opendse.optimization.modifier.RedundantCommunicationModifier Maven / Gradle / Ivy

/**
 * OpenDSE is free software: you can redistribute it and/or modify it under the
 * terms of the GNU Lesser General Public License as published by the Free
 * Software Foundation, either version 3 of the License, or (at your option) any
 * later version.
 * 
 * OpenDSE is distributed in the hope that it will be useful, but WITHOUT ANY
 * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
 * A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
 * details.
 * 
 * You should have received a copy of the GNU Lesser General Public License
 * along with OpenDSE. If not, see http://www.gnu.org/licenses/.
 */
package net.sf.opendse.optimization.modifier;

import java.util.Collection;
import java.util.HashSet;
import java.util.Set;

import net.sf.opendse.model.Application;
import net.sf.opendse.model.Dependency;
import net.sf.opendse.model.Mappings;
import net.sf.opendse.model.Models;
import net.sf.opendse.model.Resource;
import net.sf.opendse.model.Specification;
import net.sf.opendse.model.Task;

public class RedundantCommunicationModifier implements Modifier {

	@Override
	public void modify(Specification specification) {
		Application application = specification.getApplication();
		Mappings mappings = specification.getMappings();

		Set removeM = new HashSet();
		for (Task m : Models.filterCommunications(application)) {
			Collection pred = application.getPredecessors(m);
			Collection succ = application.getSuccessors(m);

			for (Task ti : pred) {
				for (Task tj : succ) {
					if (mappings.getTargets(ti).equals(mappings.getTargets(tj))) {
						Dependency d = application.findEdge(m, tj);
						application.removeEdge(d);
						application.addEdge(d, ti, tj);
					}
				}
			}
			if (application.getSuccessorCount(m) == 0) {
				removeM.add(m);
			}
		}

		for (Task m : removeM) {
			application.removeVertex(m);
		}
	}

}