use of org.objectweb.proactive.core.node.Node in project scheduling by ow2-proactive.
the class MatrixBasedTests method processSelected.
/**
* Takes the list of selected nodes, and outputs a string describing the result matrix.
*/
protected static String processSelected(List<Node> sels) {
Integer[][] selMat = new Integer[gridWidth][gridHeight];
for (Node i : sels) {
String[] nif = i.toString().split("_");
int x = Integer.parseInt(nif[1]);
int y = Integer.parseInt(nif[2]);
if (selMat[x][y] == null)
selMat[x][y] = 0;
selMat[x][y]++;
}
String out = "";
for (int j = 0; j < gridHeight; j++) {
for (int i = 0; i < gridWidth; i++) {
if (gridMatrix[i][j] != null) {
if (selMat[i][j] != null && selMat[i][j] > 0) {
out += (selMat[i][j]);
} else {
out += (".");
}
} else {
out += ("?");
}
}
}
return out;
}
use of org.objectweb.proactive.core.node.Node in project scheduling by ow2-proactive.
the class NodeSourceTest method testSetNodeAvailableKnownNode.
@Test
public void testSetNodeAvailableKnownNode() throws RMException {
Node node = createNode(PROACTIVE_PROGRAMMING_NODE_URL);
RMNode rmNode = new RMNodeImpl(node, nodeSource, client, mock(Permission.class));
nodeSource.internalAddNode(node);
nodeSource.detectedPingedDownNode(node.getNodeInformation().getName(), node.getNodeInformation().getURL());
assertThat(nodeSource.getDownNodes()).hasSize(1);
boolean result = nodeSource.setNodeAvailable(rmNode);
assertThat(result).isTrue();
assertThat(nodeSource.getDownNodes()).hasSize(0);
}
use of org.objectweb.proactive.core.node.Node in project scheduling by ow2-proactive.
the class NodeSourceTest method testSetNodeAvailableUnknownNode.
@Test
public void testSetNodeAvailableUnknownNode() throws RMException {
Node node = createNode(PROACTIVE_PROGRAMMING_NODE_URL);
RMNode rmNode = new RMNodeImpl(node, nodeSource, client, mock(Permission.class));
nodeSource.internalAddNode(node);
assertThat(nodeSource.getDownNodes()).hasSize(0);
boolean result = nodeSource.setNodeAvailable(rmNode);
assertThat(result).isFalse();
assertThat(nodeSource.getDownNodes()).hasSize(0);
}
use of org.objectweb.proactive.core.node.Node in project scheduling by ow2-proactive.
the class NodeSourceTest method createNode.
private Node createNode(String nodeUrl) {
Node node = mock(Node.class);
NodeInformation nodeInformation = mock(NodeInformation.class);
when(node.getNodeInformation()).thenReturn(nodeInformation);
when(node.getProActiveRuntime()).thenReturn(mock(ProActiveRuntime.class));
when(nodeInformation.getURL()).thenReturn(nodeUrl);
when(nodeInformation.getVMInformation()).thenReturn(mock(VMInformation.class));
return node;
}
use of org.objectweb.proactive.core.node.Node in project scheduling by ow2-proactive.
the class SelectionManager method doSelectNodes.
private NodeSet doSelectNodes(Criteria criteria, Client client) {
boolean hasScripts = criteria.getScripts() != null && criteria.getScripts().size() > 0;
boolean loggerIsDebugEnabled = logger.isDebugEnabled();
if (loggerIsDebugEnabled) {
logger.debug(client + " requested " + criteria.getSize() + " nodes with " + criteria.getTopology());
if (hasScripts) {
logger.debug("Selection scripts:");
for (SelectionScript s : criteria.getScripts()) {
logger.debug(s);
}
}
if (criteria.getBlackList() != null && criteria.getBlackList().size() > 0) {
logger.debug("Black list nodes:");
for (Node n : criteria.getBlackList()) {
logger.debug(n);
}
}
}
// can throw Exception if topology is disabled
TopologyHandler handler = RMCore.topologyManager.getHandler(criteria.getTopology());
int totalNumberOfAliveNodesRightNow = rmcore.getTotalAliveNodesNumber();
List<RMNode> freeNodes = rmcore.getFreeNodes();
// filtering out the "free node list"
// removing exclusion and checking permissions
List<RMNode> filteredNodes = filterOut(freeNodes, criteria, client);
if (filteredNodes.size() == 0) {
if (loggerIsDebugEnabled) {
logger.debug(client + " will get 0 nodes");
}
return new NodeSet();
}
// arranging nodes according to the selection policy
// if could be shuffling or node source priorities
List<RMNode> afterPolicyNodes = selectionPolicy.arrangeNodes(criteria.getSize(), filteredNodes, client);
List<Node> matchedNodes;
if (hasScripts) {
// checking if all scripts are authorized
checkAuthorizedScripts(criteria.getScripts());
// arranging nodes for script execution
List<RMNode> arrangedNodes = arrangeNodesForScriptExecution(afterPolicyNodes, criteria.getScripts(), criteria.getBindings());
List<RMNode> arrangedFilteredNodes = arrangedNodes;
if (criteria.getTopology().isTopologyBased()) {
arrangedFilteredNodes = topologyNodesFilter.filterNodes(criteria, arrangedNodes);
}
if (arrangedFilteredNodes.isEmpty()) {
matchedNodes = new LinkedList<>();
} else if (electedToRunOnAllNodes(criteria)) {
// run scripts on all available nodes
matchedNodes = runScripts(arrangedFilteredNodes, criteria);
} else {
// run scripts not on all nodes, but always on missing number of
// nodes
// until required node set is found
matchedNodes = new LinkedList<>();
while (matchedNodes.size() < criteria.getSize()) {
int numberOfNodesForScriptExecution = criteria.getSize() - matchedNodes.size();
if (numberOfNodesForScriptExecution < PAResourceManagerProperties.RM_SELECTION_MAX_THREAD_NUMBER.getValueAsInt()) {
// we can run
// "PAResourceManagerProperties.RM_SELECTION_MAX_THREAD_NUMBER.getValueAsInt()"
// scripts in parallel
// in case when we need less nodes it still useful to
// the full capacity of the thread pool to find nodes
// quicker
// it is not important if we find more nodes than needed
// subset will be selected later (topology handlers)
numberOfNodesForScriptExecution = PAResourceManagerProperties.RM_SELECTION_MAX_THREAD_NUMBER.getValueAsInt();
}
List<RMNode> subset = arrangedFilteredNodes.subList(0, Math.min(numberOfNodesForScriptExecution, arrangedFilteredNodes.size()));
matchedNodes.addAll(runScripts(subset, criteria));
// removing subset of arrangedNodes
subset.clear();
if (arrangedFilteredNodes.size() == 0) {
break;
}
}
if (loggerIsDebugEnabled) {
logger.debug(matchedNodes.size() + " nodes found after scripts execution for " + client);
}
}
} else {
matchedNodes = new LinkedList<>();
for (RMNode node : afterPolicyNodes) {
matchedNodes.add(node.getNode());
}
}
if (criteria.getTopology().isTopologyBased() && loggerIsDebugEnabled) {
logger.debug("Filtering nodes with topology " + criteria.getTopology());
}
NodeSet selectedNodes = handler.select(criteria.getSize(), matchedNodes);
if (selectedNodes.size() < criteria.getSize() && !criteria.isBestEffort()) {
selectedNodes.clear();
if (selectedNodes.getExtraNodes() != null) {
selectedNodes.getExtraNodes().clear();
}
}
// the nodes are selected, now mark them as busy.
for (Node node : selectedNodes) {
try {
// Synchronous call
rmcore.setBusyNode(node.getNodeInformation().getURL(), client);
} catch (NotConnectedException e) {
// client has disconnected during getNodes request
logger.warn(e.getMessage(), e);
return null;
}
}
// marking extra selected nodes as busy
if (selectedNodes.size() > 0 && selectedNodes.getExtraNodes() != null) {
for (Node node : new LinkedList<>(selectedNodes.getExtraNodes())) {
try {
// synchronous call
rmcore.setBusyNode(node.getNodeInformation().getURL(), client);
} catch (NotConnectedException e) {
// client has disconnected during getNodes request
logger.warn(e.getMessage(), e);
return null;
}
}
}
if (logger.isInfoEnabled()) {
String extraNodes = selectedNodes.getExtraNodes() != null && selectedNodes.getExtraNodes().size() > 0 ? " and " + selectedNodes.getExtraNodes().size() + " extra nodes" : "";
logger.info(client + " requested " + criteria.getSize() + " nodes with " + criteria.getTopology() + " and will get " + selectedNodes.size() + " nodes " + extraNodes + " [totalNumberOfAliveNodesRightNow:" + totalNumberOfAliveNodesRightNow + ";freeNodes:" + freeNodes.size() + ";filteredNodes:" + filteredNodes.size() + ";reordered after policy:" + afterPolicyNodes.size() + ";selection script present:" + hasScripts + ";nodes filtered by selection script:" + matchedNodes.size() + ";selectedNodes:" + selectedNodes.size() + "]");
}
if (loggerIsDebugEnabled) {
for (Node n : selectedNodes) {
logger.debug(n.getNodeInformation().getURL());
}
}
return selectedNodes;
}
Aggregations