org.btrplace.scheduler.choco.constraint.mttr.MovementGraph Maven / Gradle / Ivy

Go to download
/*
 * Copyright (c) 2016 University Nice Sophia Antipolis
 *
 * This file is part of btrplace.
 * This library 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.
 *
 * This library 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 this program.  If not, see .
 */

package org.btrplace.scheduler.choco.constraint.mttr;

import org.btrplace.model.Node;
import org.btrplace.scheduler.choco.ReconfigurationProblem;
import org.btrplace.scheduler.choco.Slice;
import org.btrplace.scheduler.choco.transition.VMTransition;
import org.chocosolver.solver.variables.IntVar;

import java.util.*;

/**
 * Class denoting the movement of the running VMs from their source to their destination node.
 *
 * @author Fabien Hermenier
 */
public class MovementGraph {

    private ReconfigurationProblem rp;

    private Map> incoming;

    private Map> outgoings;

    /**
     * Make a new graph.
     *
     * @param p the associated problem
     */
    public MovementGraph(ReconfigurationProblem p) {
        this.rp = p;
        incoming = new HashMap<>();
        outgoings = new HashMap<>();
    }

    public void make() {
        incoming.clear();
        outgoings.clear();

        for (VMTransition a : rp.getVMActions()) {
            Slice cSlice = a.getCSlice();
            Slice dSlice = a.getDSlice();

            if (cSlice != null) {
                addOutgoing(cSlice);
            }
            if (dSlice != null) {
                addIncoming(dSlice);
            }
        }
    }

    private void addOutgoing(Slice cSlice) {
        Node h = rp.getNode(cSlice.getHoster().getLB());
        List l = outgoings.get(h);
        if (l == null) {
            l = new ArrayList<>();
            outgoings.put(h, l);
        }
        l.add(cSlice.getStart());
    }

    private void addIncoming(Slice cSlice) {
        Node h = rp.getNode(cSlice.getHoster().getLB());
        List l = incoming.get(h);
        if (l == null) {
            l = new ArrayList<>();
            incoming.put(h, l);
        }
        l.add(cSlice.getStart());
    }

    /**
     * Get the start moment of the movements that terminate
     * on a given node
     *
     * @param n the destination node
     * @return a list of start moment. May be empty
     */
    public List getIncoming(Node n) {
        List l = incoming.get(n);
        if (l == null) {
            l = Collections.emptyList();
        }
        return l;
    }

    /**
     * Get the start moment of the movements that leave
     * from a given node
     *
     * @param n the source node
     * @return a list of start moment. May be empty
     */
    public List getOutgoing(Node n) {
        List l = outgoings.get(n);
        if (l == null) {
            l = Collections.emptyList();
        }
        return l;

    }
}