Changeset 1247 for DCWoRMS/branches/coolemall/src/example/localplugin/FCFSBF_ConsolidationClusterPlugin.java
- Timestamp:
- 11/28/13 10:54:54 (11 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
DCWoRMS/branches/coolemall/src/example/localplugin/FCFSBF_ConsolidationClusterPlugin.java
r1207 r1247 12 12 import schedframe.events.scheduling.SchedulingEvent; 13 13 import schedframe.resources.ResourceStatus; 14 import schedframe.resources.computing. ComputingNode;14 import schedframe.resources.computing.Node; 15 15 import schedframe.resources.computing.ComputingResource; 16 16 import schedframe.resources.units.Memory; … … 74 74 private Map<ResourceUnitName, ResourceUnit> chooseResourcesForExecution(ClusterResourceManager resourceManager, TaskInterface<?> task) throws NoSuchFieldException { 75 75 76 List< ComputingNode> nodes = resourceManager.getComputingNodes();76 List<Node> nodes = resourceManager.getNodes(); 77 77 nodes = findSuitableNodes(task, nodes); 78 Collections.sort(nodes, new Comparator< ComputingNode>(){79 public int compare( ComputingNode node1, ComputingNode node2){78 Collections.sort(nodes, new Comparator<Node>(){ 79 public int compare(Node node1, Node node2){ 80 80 return node1.getResourceCharacteristic().getParameters().get("category").get(0).getContent().compareTo(node2.getResourceCharacteristic().getParameters().get("category").get(0).getContent()); 81 81 } … … 83 83 if(nodes.size() > 0) 84 84 { 85 ComputingNode node = nodes.get(0);85 Node node = nodes.get(0); 86 86 Map<ResourceUnitName, ResourceUnit> map = new HashMap<ResourceUnitName, ResourceUnit>(); 87 87 List<ComputingResource> choosenResources = new ArrayList<ComputingResource>(); … … 117 117 } 118 118 119 private List< ComputingNode> findSuitableNodes(TaskInterface<?> task, List<ComputingNode> nodes) throws NoSuchFieldException{119 private List<Node> findSuitableNodes(TaskInterface<?> task, List<Node> nodes) throws NoSuchFieldException{ 120 120 int cpuRequest; 121 121 try { … … 130 130 memoryRequest = 0; 131 131 } 132 List< ComputingNode> suitableNodes = new ArrayList<ComputingNode>();133 for( ComputingNode node: nodes){132 List<Node> suitableNodes = new ArrayList<Node>(); 133 for(Node node: nodes){ 134 134 if(node.getFreeProcessorsNumber() >= cpuRequest && node.getFreeMemory() >= memoryRequest){ 135 135 suitableNodes.add(node);
Note: See TracChangeset
for help on using the changeset viewer.