org.btrplace.scheduler.runner.disjoint.splitter.FenceSplitter Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of split Show documentation

Instance solvers that split a single problem into smaller parts to solve them in parallel.

There is a newer version: 1.12.10

/*
 * 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.runner.disjoint.splitter;

import gnu.trove.map.hash.TIntIntHashMap;
import org.btrplace.model.Instance;
import org.btrplace.model.Node;
import org.btrplace.model.VM;
import org.btrplace.model.constraint.Fence;
import org.btrplace.scheduler.runner.disjoint.model.SplittableElementSet;

import java.util.List;
import java.util.Set;

/**
 * Splitter for {@link org.btrplace.model.constraint.Fence} constraints.
 * 
 * When the constraint focuses VMs or nodes among different partitions,
 * the constraint is split accordingly.
 *
 * @author Fabien Hermenier
 */
public class FenceSplitter implements ConstraintSplitter {

    @Override
    public Class getKey() {
        return Fence.class;
    }

    @Override
    public boolean split(Fence cstr, Instance origin, final List partitions, TIntIntHashMap vmsPosition, TIntIntHashMap nodePosition) {
        final SplittableElementSet nodeIndex = SplittableElementSet.newNodeIndex(cstr.getInvolvedNodes(), nodePosition);

        VM v = cstr.getInvolvedVMs().iterator().next();
        int p = vmsPosition.get(v.id());

        Set ns = nodeIndex.getSubSet(p);
        if (!ns.isEmpty()) {
            return partitions.get(p).getSatConstraints().add(new Fence(v, ns));
        }
        return true;
    }
}