NodeAllocationPolicy (mws)

Overview

Package

Class

Deprecated

Index

Help

Groovy Documentation

FRAMES NO FRAMES

SUMMARY: NESTED | ENUM CONSTANTS | FIELD | PROPERTY | METHOD

DETAIL: ENUM CONSTANTS | FIELD | PROPERTY | METHOD

com.ace.mws.nodes
[Groovy] Enum NodeAllocationPolicy

java.lang.Object
  com.ace.mws.nodes.NodeAllocationPolicy

enum NodeAllocationPolicy

Node Allocation enumeration.

Authors:: bkimball

Enum Constant Summary
`CONTIGUOUS` This algorithm will allocate nodes in contiguous (linear) blocks as required by the Compaq RMS system.
`CPULOAD` Nodes are selected which have the maximum amount of available, unused cpu power, i.e. [# of CPU's] - [CPU load].
`CUSTOMPRIORITY` Alias for PRIORITY.
`FASTEST` This algorithm will select nodes in 'fastest node first' order.
`FIRSTAVAILABLE` Simple first come, first served algorithm where nodes are allocated in the order they are presented by the resource manager.
`FIRSTSET`
`INREPORTEDORDER` Alias for FIRSTAVAILABLE.
`INREVERSEREPORTEDORDER` Alias for LASTAVAILABLE.
`LASTAVAILABLE` This algorithm selects resources so as to minimize the amount of time after the job and before the trailing reservation.
`LOCAL` This will call the locally created contrib node allocation algorithm.
`MAXBALANCE` This algorithm will attempt to allocate the most 'balanced' set of nodes possible to a job.
`MINGLOBAL`
`MINIMUMCONFIGUREDRESOURCES` Alias for MINRESOURCE.
`MINLOCAL`
`MINRESOURCE` This algorithm prioritizes nodes according to the configured resources on each node.
`NODESPEED` Alias for FASTEST.
`NONE` No node allocation policy is specified.
`PLUGIN`
`PRIORITY` This algorithm allows a site to specify the priority of various static and dynamic aspects of compute nodes and allocate them with preference for higher priority nodes.
`PROCESSORLOAD` Alias for CPULOAD.
`PROCESSORSPEEDBALANCE` Alias for MAXBALANCE.

Property Summary
`String`	`str`

Constructor Summary
`private NodeAllocationPolicy(String str)`

Method Summary
`static NodeAllocationPolicy`	`parseNodeAllocationPolicyString(String nodeAllocationPolicyString)` Parses a string and converts it into a NodeAllocationPolicy enum value if possible.
`String`	`toString()`
`NodeAllocationPolicy`	`valueOf(String name)` Returns the enum constant of this type with the specified name.
`NodeAllocationPolicy[]`	`values()` Returns an array containing the constants of this enum type, in the order they are declared.

Methods inherited from class Object
wait, wait, wait, equals, toString, hashCode, getClass, notify, notifyAll

Enum Constant Detail

CONTIGUOUS

NodeAllocationPolicy CONTIGUOUS

This algorithm will allocate nodes in contiguous (linear) blocks as required by the Compaq RMS system.

CPULOAD

NodeAllocationPolicy CPULOAD

Nodes are selected which have the maximum amount of available, unused cpu power, i.e. [# of CPU's] - [CPU load]. Good algorithm for timesharing node systems. This algorithm is only applied to jobs starting immediately. For the purpose of future reservations, the MINRESOURCE algorithm is used.

CUSTOMPRIORITY

NodeAllocationPolicy CUSTOMPRIORITY

Alias for PRIORITY.

FASTEST

NodeAllocationPolicy FASTEST

This algorithm will select nodes in 'fastest node first' order. Nodes will be selected by node speed if specified. If node speed is not specified, nodes will be selected by processor speed. If neither is specified, nodes will be selected in a random order.

FIRSTAVAILABLE

NodeAllocationPolicy FIRSTAVAILABLE

Simple first come, first served algorithm where nodes are allocated in the order they are presented by the resource manager. This is a very simple, very fast algorithm.

FIRSTSET

NodeAllocationPolicy FIRSTSET

INREPORTEDORDER

NodeAllocationPolicy INREPORTEDORDER

Alias for FIRSTAVAILABLE.

INREVERSEREPORTEDORDER

NodeAllocationPolicy INREVERSEREPORTEDORDER

Alias for LASTAVAILABLE.

LASTAVAILABLE

NodeAllocationPolicy LASTAVAILABLE

This algorithm selects resources so as to minimize the amount of time after the job and before the trailing reservation. This algorithm is a best fit in time algorithm which minimizes the impact of reservation based node-time fragmentation. It is useful in systems where a large number of reservations (job, standing, or administrative) are in place.

LOCAL

NodeAllocationPolicy LOCAL

This will call the locally created contrib node allocation algorithm.

MAXBALANCE

NodeAllocationPolicy MAXBALANCE

This algorithm will attempt to allocate the most 'balanced' set of nodes possible to a job. In most cases, but not all, the metric for balance of the nodes is node speed. Thus, if possible, nodes with identical speeds will be allocated to the job. If identical speed nodes cannot be found, the algorithm will allocate the set of nodes with the minimum node speed 'span' or range.

MINGLOBAL

NodeAllocationPolicy MINGLOBAL

MINIMUMCONFIGUREDRESOURCES

NodeAllocationPolicy MINIMUMCONFIGUREDRESOURCES

Alias for MINRESOURCE.

MINLOCAL

NodeAllocationPolicy MINLOCAL

MINRESOURCE

NodeAllocationPolicy MINRESOURCE

This algorithm prioritizes nodes according to the configured resources on each node. Those nodes with the fewest configured resources which still meet the job's resource constraints are selected.

NODESPEED

NodeAllocationPolicy NODESPEED

Alias for FASTEST.

NONE

NodeAllocationPolicy NONE

No node allocation policy is specified. Moab defaults to MINRESOURCE when this is the case.

PLUGIN

NodeAllocationPolicy PLUGIN

PRIORITY

NodeAllocationPolicy PRIORITY

This algorithm allows a site to specify the priority of various static and dynamic aspects of compute nodes and allocate them with preference for higher priority nodes. It is highly flexible allowing node attribute and usage information to be combined with reservation affinity.

PROCESSORLOAD

NodeAllocationPolicy PROCESSORLOAD

Alias for CPULOAD.

PROCESSORSPEEDBALANCE

NodeAllocationPolicy PROCESSORSPEEDBALANCE

Alias for MAXBALANCE.

Property Detail

str

String str

Constructor Detail