package test.thermal.recs.plugins.scheduling; import gridsim.dcworms.DCWormsTags; import java.io.FileInputStream; import java.io.FileNotFoundException; import java.io.IOException; import java.util.ArrayList; import java.util.Collections; import java.util.Comparator; import java.util.HashMap; import java.util.List; import java.util.Map; import java.util.MissingResourceException; import java.util.PropertyResourceBundle; import java.util.ResourceBundle; import schedframe.events.scheduling.SchedulingEvent; import schedframe.resources.ResourceStatus; import schedframe.resources.computing.Node; import schedframe.resources.computing.ComputingResource; import schedframe.resources.computing.Core; import schedframe.resources.computing.profiles.energy.power.StandardPowerStateName; import schedframe.resources.units.ProcessingElements; import schedframe.resources.units.ResourceUnit; import schedframe.resources.units.ResourceUnitName; import schedframe.resources.units.StandardResourceUnitName; import schedframe.scheduling.manager.resources.ClusterResourceManager; import schedframe.scheduling.manager.resources.ResourceManager; import schedframe.scheduling.manager.tasks.JobRegistry; import schedframe.scheduling.plan.SchedulingPlanInterface; import schedframe.scheduling.plan.impl.SchedulingPlan; import schedframe.scheduling.plugin.ModuleList; import schedframe.scheduling.queue.TaskQueue; import schedframe.scheduling.queue.TaskQueueList; import schedframe.scheduling.tasks.TaskInterface; public class RecsExclusivenessEnOptSP extends RecsSP { private static String TIME_DATA_FILE_NAME = "src/test/thermal/recs/data/time_data.properties"; private static String POWER_DATA_FILE_NAME = "src/test/thermal/recs/data/power_data.properties"; private ResourceBundle powBundle; private ResourceBundle timeBundle; public SchedulingPlanInterface schedule(SchedulingEvent event, TaskQueueList queues, JobRegistry jobRegistry, ResourceManager resManager, ModuleList modules) { ClusterResourceManager resourceManager = (ClusterResourceManager) resManager; SchedulingPlan plan = new SchedulingPlan(); // choose the events types to serve. // Different actions for different events are possible. switch (event.getType()) { case START_TASK_EXECUTION: case TASK_FINISHED: //case TIMER: // our tasks are placed only in first queue (see BaseLocalSchedulingPlugin.placeJobsInQueues() method) TaskQueue q = queues.get(0); // check all tasks in queue for (int i = 0; i < q.size(); i++) { TaskInterface task = q.get(i); initApplicationType(task); // if status of the tasks in READY if (task.getStatus() == DCWormsTags.READY) { Map choosenResources = chooseResourcesForExecution(resourceManager, task); if (choosenResources != null) { addToSchedulingPlan(plan, task, choosenResources); } } } break; } return plan; } private Map chooseResourcesForExecution( ClusterResourceManager resourceManager, TaskInterface task) { Map map; List nodes = resourceManager.getNodes(); Collections.shuffle(nodes); Collections.sort(nodes, new EnergyComparator(task)); for (Node node : nodes) { int cpuRequest; try { cpuRequest = Double.valueOf(task.getCpuCntRequest()).intValue(); } catch (NoSuchFieldException e) { cpuRequest = 0; } if (cpuRequest != 0) { List cores = node.getProcessors().get(0).getCores(); if (cores.size() < cpuRequest/* || node.getProcessors().get(0).filterDescendants(properties).size() != cores.size()*/) { continue; } int freeCores = 0; for(Core core: cores){ if(core.getStatus() == ResourceStatus.FREE) freeCores++; } if(freeCores != cores.size()) continue; try { if(!getExecutiveness(createExecutivenessQuery(task, node))) continue; } catch (FileNotFoundException e) { continue; } catch (IOException e) { continue; } catch (MissingResourceException e){ continue; } List choosenResources = new ArrayList(); for (int i = 0; i < cores.size(); i++) { if (cores.get(i).getStatus() == ResourceStatus.FREE) { //choosenResources.add(cores.get(i)); cpuRequest--; } } choosenResources.add(node); if (cpuRequest > 0) { //continue; } map = new HashMap(); ProcessingElements pe = new ProcessingElements(); pe.addAll(choosenResources); map.put(StandardResourceUnitName.PE, pe); return map; } } return null; } protected String createQuery(TaskInterface task, Node node) { String query; query = getApplicationType(task) + "." + getNodeCategory(node) + "." + getFrequency(node) + "." + getCoreCnt(task); return query; } protected double getMeasuredPower(String query) throws FileNotFoundException, IOException{ ResourceBundle powBundle = getPowBundle(); return Double.valueOf(powBundle.getString(query)).doubleValue(); } private ResourceBundle getPowBundle() throws FileNotFoundException, IOException{ if(powBundle == null){ powBundle = new PropertyResourceBundle(new FileInputStream(POWER_DATA_FILE_NAME)); } return powBundle; } protected double getMeasuredTime(String query) throws FileNotFoundException, IOException{ ResourceBundle timeBundle = getTimeBundle(); return Double.valueOf(timeBundle.getString(query)).doubleValue(); } private ResourceBundle getTimeBundle() throws FileNotFoundException, IOException{ if(timeBundle == null){ timeBundle = new PropertyResourceBundle(new FileInputStream(TIME_DATA_FILE_NAME)); } return timeBundle; } class EnergyComparator implements Comparator{ private TaskInterface task; public EnergyComparator(TaskInterface task){ this.task = task; } public int compare(Node node1, Node node2){ double node1EU = Double.MAX_VALUE; double node2EU = Double.MAX_VALUE; try { node1EU = getMeasuredTime(createQuery(task, node1)) * Math.abs(getMeasuredPower(createQuery(task, node1)) - node1.getPowerInterface().getPowerConsumption(StandardPowerStateName.ON)); } catch (FileNotFoundException e) { } catch (IOException e) { } catch (MissingResourceException e){ } catch (NoSuchFieldException e) { } try { node2EU = getMeasuredTime(createQuery(task, node2)) * Math.abs(getMeasuredPower(createQuery(task, node2)) - node2.getPowerInterface().getPowerConsumption(StandardPowerStateName.ON)); } catch (FileNotFoundException e) { } catch (IOException e) { } catch (MissingResourceException e){ } catch (NoSuchFieldException e) { } if(node1EU > node2EU) return 1; else if (node1EU < node2EU) return -1; else return 0; } } }