- Timestamp:
- 03/26/12 12:03:27 (13 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
xssim/trunk/src/example/localplugin/FCFSConsolidationClusterLocalPlugin.java
r163 r192 2 2 3 3 import gridsim.Gridlet; 4 import gridsim.gssim.ResourceHistoryItem;5 import gridsim.gssim.SubmittedTask;6 4 7 5 import java.util.ArrayList; … … 17 15 import schedframe.scheduling.TaskInterface; 18 16 import schedframe.scheduling.events.SchedulingEvent; 19 import schedframe.scheduling.events.TaskFinishedEvent;20 17 import schedframe.scheduling.plugin.grid.ModuleList; 21 18 import schedframe.scheduling.utils.ResourceParameterName; 22 19 import test.rewolucja.GSSIMJobInterface; 23 import test.rewolucja.energy.profile.PStateType;24 20 import test.rewolucja.resources.ProcessingElements; 25 21 import test.rewolucja.resources.ResourceStatus; 26 import test.rewolucja.resources.ResourceType;27 22 import test.rewolucja.resources.manager.implementation.ClusterResourceManager; 28 23 import test.rewolucja.resources.manager.interfaces.ResourceManagerInterface; 29 24 import test.rewolucja.resources.physical.base.ComputingResource; 30 import test.rewolucja.resources.physical.implementation.CPU;31 25 import test.rewolucja.resources.physical.implementation.ComputingNode; 32 26 import test.rewolucja.scheduling.JobRegistryInterface; … … 52 46 case TASK_FINISHED: 53 47 // our tasks are placed only in first queue (see 54 // BaseLocalPlugin.place TasksInQueues() method)48 // BaseLocalPlugin.placeJobsInQueues() method) 55 49 Queue q = queues.get(0); 56 50 // check all tasks in queue … … 111 105 } 112 106 if (memoryRequest != 0) { 113 Memory memory = new Memory(node.getMemory (), memoryRequest, memoryRequest);107 Memory memory = new Memory(node.getMemoryUnit(), memoryRequest, memoryRequest); 114 108 map.put(ResourceParameterName.MEMORY, memory); 115 109 } … … 132 126 memoryRequest = 0; 133 127 } 134 List<ComputingNode> avNodes = new ArrayList<ComputingNode>();128 List<ComputingNode> suitableNodes = new ArrayList<ComputingNode>(); 135 129 for(ComputingNode node: nodes){ 136 130 if(node.getFreeProcessorsNumber() >= cpuRequest && node.getFreeMemory() >= memoryRequest){ 137 avNodes.add(node);131 suitableNodes.add(node); 138 132 } 139 133 } 140 return avNodes;134 return suitableNodes; 141 135 } 142 136
Note: See TracChangeset
for help on using the changeset viewer.