/** * **************************************************************************** * Copyright (c) 2010-2016 by Min Cai (min.cai.china@gmail.com). * <p> * This file is part of the Archimulator multicore architectural simulator. * <p> * Archimulator is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * <p> * Archimulator 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 General Public License for more details. * <p> * You should have received a copy of the GNU General Public License * along with Archimulator. If not, see <http://www.gnu.org/licenses/>. * **************************************************************************** */ package archimulator.uncore.cache.partitioning; import archimulator.common.CPUExperiment; import archimulator.common.Simulation; import archimulator.common.SimulationObject; import archimulator.common.SimulationType; import archimulator.core.Thread; import archimulator.uncore.cache.EvictableCache; import archimulator.uncore.coherence.msi.controller.DirectoryController; import org.paukov.combinatorics.Factory; import org.paukov.combinatorics.Generator; import org.paukov.combinatorics.ICombinatoricsVector; import java.util.ArrayList; import java.util.List; import java.util.function.Predicate; /** * Cache partitioning helper. * * @author Min Cai */ public abstract class CachePartitioningHelper implements Partitioner { private EvictableCache<?> cache; private Predicate<Integer> shouldIncludePredicate; private int numCyclesElapsedPerInterval; private long numIntervals; private int numCyclesElapsed; private int numThreads; private List<Integer> partition; /** * Create a cache partitioning helper. * * @param cache the cache */ public CachePartitioningHelper(final EvictableCache<?> cache) { this.cache = cache; // this.numThreads = cache.getExperiment().getConfig().getNumThreadsPerCore() * this.l2Controller.getExperiment().getConfig().getNumCores(); this.numThreads = this.cache.getExperiment().getConfig().getNumCores(); this.partition = new ArrayList<>(); int l2Associativity = this.cache.getAssociativity(); if (l2Associativity < this.numThreads) { throw new IllegalArgumentException(); } for (int i = 0; i < this.numThreads; i++) { partition.add(l2Associativity / this.numThreads); } this.numCyclesElapsedPerInterval = 5000000; this.cache.getCycleAccurateEventQueue().getPerCycleEvents().add(() -> { if (cache.getSimulation().getType() != SimulationType.FAST_FORWARD && canPartition(cache)) { //TODO: should not be hardcoded!!! numCyclesElapsed++; if (numCyclesElapsed == numCyclesElapsedPerInterval) { newInterval(); numCyclesElapsed = 0; numIntervals++; } } }); } //TODO: to be refactored out!!! /** * Get a value indicating whether cache partitioning is needed or not. * * @param simulationObject the simulation object * @return a value indicating whether cache partitioning is needed or not */ public static boolean canPartition(SimulationObject<CPUExperiment, Simulation> simulationObject) { return simulationObject.getExperiment().getConfig().getNumCores() == 2 && simulationObject.getExperiment().getConfig().getNumThreadsPerCore() == 2 && simulationObject.getSimulation().getProcessor().getCores().get(1).getThreads().get(0).getContext() != null; } /** * New interval. */ protected abstract void newInterval(); /** * Get the cache. * * @return the cache */ public EvictableCache<?> getCache() { return cache; } /** * Get the L2 cache controller. * * @return the L2 cache controller */ public DirectoryController getL2Controller() { return getCache().getSimulation().getProcessor().getMemoryHierarchy().getL2Controller(); } /** * Get the measuring interval in cycles. * * @return the measuring interval in cycles */ public int getNumCyclesElapsedPerInterval() { return numCyclesElapsedPerInterval; } /** * Get the number of intervals. * * @return the number of intervals */ public long getNumIntervals() { return numIntervals; } /** * Get the number of cycles elapsed. * * @return the number of cycles elapsed */ public int getNumCyclesElapsed() { return numCyclesElapsed; } /** * Get the number of threads. * * @return the number of threads */ public int getNumThreads() { return numThreads; } /** * Get the partition for the specified set. * * @return the partition for the specified set */ public List<Integer> getPartition() { return partition; } /** * Set the partition for the specified set. * * @param partition the partition */ public void setPartition(List<Integer> partition) { this.partition = partition; } @Override public void setShouldIncludePredicate(Predicate<Integer> shouldIncludePredicate) { this.shouldIncludePredicate = shouldIncludePredicate; } /** * Get a value indicating whether should include the specified set in this cache partitioning helper. * * @param set the set * @return value indicating whether should include the specified set in this cache partitioning helper */ protected boolean shouldInclude(int set) { return shouldIncludePredicate.test(set); } /** * Get the identifier for the specified thread. * * @param thread the thread * @return the identifier for the specified thread */ public static int getThreadIdentifier(Thread thread) { return thread.getCore().getNum(); } /** * Divide the integer n into k partitions. * * @param n the integer n to be partitioned * @param k the number of partitions * @return the partition list of the specified integer n */ public static List<List<Integer>> partition(int n, int k) { List<List<Integer>> result = new ArrayList<>(); Generator<Integer> generator = Factory.createCompositionGenerator(n); for (ICombinatoricsVector<Integer> vector : generator) { if (vector.getSize() == k) { result.add(vector.getVector()); } } return result; } }