com.yahoo.vespa.hosted.provision.provisioning.NodeCandidate Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of node-repository Show documentation
Show all versions of node-repository Show documentation
Keeps track of node assignment in a multi-application setup.
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
package com.yahoo.vespa.hosted.provision.provisioning;
import com.yahoo.component.Version;
import com.yahoo.config.provision.ApplicationId;
import com.yahoo.config.provision.ClusterMembership;
import com.yahoo.config.provision.ClusterSpec;
import com.yahoo.config.provision.Flavor;
import com.yahoo.config.provision.NodeResources;
import com.yahoo.config.provision.NodeType;
import com.yahoo.vespa.hosted.provision.LockedNodeList;
import com.yahoo.vespa.hosted.provision.Node;
import com.yahoo.vespa.hosted.provision.NodeList;
import com.yahoo.vespa.hosted.provision.Nodelike;
import com.yahoo.vespa.hosted.provision.node.Allocation;
import com.yahoo.vespa.hosted.provision.node.IP;
import com.yahoo.yolean.Exceptions;
import java.time.Instant;
import java.util.List;
import java.util.Objects;
import java.util.Optional;
import java.util.logging.Logger;
import static com.yahoo.collections.Optionals.emptyOrEqual;
/**
* A node candidate containing the details required to prioritize it for allocation. This is immutable.
*
* @author smorgrav
* @author bratseth
*/
public abstract class NodeCandidate implements Nodelike, Comparable {
private static final Logger log = Logger.getLogger(NodeCandidate.class.getName());
/** List of host states ordered by preference (ascending) */
private static final List HOST_STATE_PRIORITY =
List.of(Node.State.provisioned, Node.State.ready, Node.State.active);
private static final NodeResources zeroResources =
new NodeResources(0, 0, 0, 0, NodeResources.DiskSpeed.any, NodeResources.StorageType.any,
NodeResources.Architecture.getDefault(), NodeResources.GpuResources.zero());
/** The free capacity on the parent of this node, before adding this node to it */
protected final NodeResources freeParentCapacity;
/** The parent host */
final Optional parent;
/** True if this node is allocated on a host that should be dedicated as a spare */
final boolean violatesSpares;
/** True if this node is allocated on an exclusive network switch in its cluster */
final boolean exclusiveSwitch;
/** This node does not exist in the node repository yet */
final boolean isNew;
/** This node can be resized to the new NodeResources */
final boolean isResizable;
/** The parent host must become exclusive to the implied application */
final boolean exclusiveParent;
private NodeCandidate(NodeResources freeParentCapacity, Optional parent, boolean violatesSpares, boolean exclusiveSwitch,
boolean exclusiveParent, boolean isNew, boolean isResizeable) {
if (isResizeable && isNew)
throw new IllegalArgumentException("A new node cannot be resizable");
this.freeParentCapacity = freeParentCapacity;
this.parent = parent;
this.violatesSpares = violatesSpares;
this.exclusiveSwitch = exclusiveSwitch;
this.exclusiveParent = exclusiveParent;
this.isNew = isNew;
this.isResizable = isResizeable;
}
public abstract Optional allocation();
public abstract Node.State state();
public abstract boolean wantToRetire();
public abstract boolean preferToRetire();
/** Returns true if we have decided to retire this node as part of this deployment */
public boolean retiredNow() { return false; }
public abstract boolean wantToFail();
public abstract Flavor flavor();
public abstract NodeCandidate allocate(ApplicationId owner, ClusterMembership membership, NodeResources requestedResources, Instant at);
/** Called when the node described by this candidate must be created */
public abstract NodeCandidate withNode();
/** Returns a copy of this with exclusive switch set to given value */
public abstract NodeCandidate withExclusiveSwitch(boolean exclusiveSwitch);
public abstract NodeCandidate withExclusiveParent(boolean exclusiveParent);
/**
* Returns the node instance of this candidate, allocating it if necessary.
*
* @throws IllegalStateException if the node candidate is invalid
*/
public abstract Node toNode();
/** Returns whether this node can - as far as we know - be used to run the application workload */
public abstract boolean isValid();
/** Returns whether this can be replaced by any of the reserved candidates */
public boolean replaceableBy(List candidates) {
return candidates.stream()
.filter(candidate -> candidate.state() == Node.State.reserved)
.anyMatch(candidate -> {
int switchPriority = candidate.switchPriority(this);
if (switchPriority < 0) {
return true;
} else if (switchPriority > 0) {
return false;
}
return candidate.hostPriority(this) < 0;
});
}
/**
* Compare this candidate to another
*
* @return negative if this should be preferred over other
*/
@Override
public int compareTo(NodeCandidate other) {
// First always pick nodes without violation above nodes with violations
if (!this.violatesSpares && other.violatesSpares) return -1;
if (!other.violatesSpares && this.violatesSpares) return 1;
// Choose active nodes
if (this.state() == Node.State.active && other.state() != Node.State.active) return -1;
if (other.state() == Node.State.active && this.state() != Node.State.active) return 1;
// Choose reserved nodes from a previous allocation attempt (which exist in node repo)
if (this.isInNodeRepoAndReserved() && ! other.isInNodeRepoAndReserved()) return -1;
if (other.isInNodeRepoAndReserved() && ! this.isInNodeRepoAndReserved()) return 1;
// Choose nodes that are not preferred to retire
if (!this.preferToRetire() && other.preferToRetire()) return -1;
if (!other.preferToRetire() && this.preferToRetire()) return 1;
// Choose inactive nodes
if (this.state() == Node.State.inactive && other.state() != Node.State.inactive) return -1;
if (other.state() == Node.State.inactive && this.state() != Node.State.inactive) return 1;
// Choose ready nodes
if (this.state() == Node.State.ready && other.state() != Node.State.ready) return -1;
if (other.state() == Node.State.ready && this.state() != Node.State.ready) return 1;
if (this.state() != other.state())
throw new IllegalStateException("Nodes " + this + " and " + other + " have different states");
if (this.parent.isPresent() && other.parent.isPresent()) {
// Prefer reserved hosts (that they are reserved to the right tenant is ensured elsewhere)
if ( this.parent.get().reservedTo().isPresent() && ! other.parent.get().reservedTo().isPresent()) return -1;
if ( ! this.parent.get().reservedTo().isPresent() && other.parent.get().reservedTo().isPresent()) return 1;
// Prefer node on exclusive switch
int switchPriority = switchPriority(other);
if (switchPriority != 0) return switchPriority;
// Prefer node with cheapest storage
int diskCostDifference = NodeResources.DiskSpeed.compare(this.parent.get().flavor().resources().diskSpeed(),
other.parent.get().flavor().resources().diskSpeed());
if (diskCostDifference != 0)
return diskCostDifference;
int storageCostDifference = NodeResources.StorageType.compare(this.parent.get().flavor().resources().storageType(),
other.parent.get().flavor().resources().storageType());
if (storageCostDifference != 0)
return storageCostDifference;
// Prefer hosts that are at least twice the size of this node
// (utilization is more even if one application does not dominate the host)
if ( lessThanHalfTheHost(this) && ! lessThanHalfTheHost(other)) return -1;
if ( ! lessThanHalfTheHost(this) && lessThanHalfTheHost(other)) return 1;
}
// Prefer host with the least skew
int hostPriority = hostPriority(other);
if (hostPriority != 0) return hostPriority;
// Prefer node with the cheapest flavor
if (this.flavor().cost() < other.flavor().cost()) return -1;
if (other.flavor().cost() < this.flavor().cost()) return 1;
// Prefer node where host is in more desirable state
int thisHostStatePri = this.parent.map(host -> HOST_STATE_PRIORITY.indexOf(host.state())).orElse(-2);
int otherHostStatePri = other.parent.map(host -> HOST_STATE_PRIORITY.indexOf(host.state())).orElse(-2);
if (thisHostStatePri != otherHostStatePri) return otherHostStatePri - thisHostStatePri;
// Prefer lower indexes to minimize redistribution
if (this.allocation().isPresent() && other.allocation().isPresent())
return Integer.compare(this.allocation().get().membership().index(),
other.allocation().get().membership().index());
// Prefer host with the latest OS version
Version thisHostOsVersion = this.parent.flatMap(host -> host.status().osVersion().current()).orElse(Version.emptyVersion);
Version otherHostOsVersion = other.parent.flatMap(host -> host.status().osVersion().current()).orElse(Version.emptyVersion);
if (thisHostOsVersion.isAfter(otherHostOsVersion)) return -1;
if (otherHostOsVersion.isAfter(thisHostOsVersion)) return 1;
return 0;
}
/** Returns the allocation skew of the parent of this before adding this node to it */
double skewWithoutThis() { return skewWith(zeroResources); }
/** Returns the allocation skew of the parent of this after adding this node to it */
double skewWithThis() { return skewWith(resources()); }
/** Returns a copy of this with node set to given value */
NodeCandidate withNode(Node node) {
return withNode(node, retiredNow());
}
/** Returns a copy of this with node set to given value */
NodeCandidate withNode(Node node, boolean retiredNow) {
return new ConcreteNodeCandidate(node, retiredNow, freeParentCapacity, parent, violatesSpares, exclusiveSwitch, exclusiveParent, isNew, isResizable);
}
/** Returns the switch priority, based on switch exclusivity, of this compared to other */
private int switchPriority(NodeCandidate other) {
if (this.exclusiveSwitch && !other.exclusiveSwitch) return -1;
if (other.exclusiveSwitch && !this.exclusiveSwitch) return 1;
return 0;
}
/** Returns the host priority, based on allocation skew, of this compared to other */
private int hostPriority(NodeCandidate other) {
return Double.compare(this.skewWithThis() - this.skewWithoutThis(),
other.skewWithThis() - other.skewWithoutThis());
}
private boolean lessThanHalfTheHost(NodeCandidate node) {
var n = node.resources();
var h = node.parent.get().resources();
if (h.vcpu() < n.vcpu() * 2) return false;
if (h.memoryGiB() < n.memoryGiB() * 2) return false;
if (h.diskGb() < n.diskGb() * 2) return false;
return true;
}
private double skewWith(NodeResources resources) {
if (parent.isEmpty()) return 0;
NodeResources free = freeParentCapacity.justNumbers().subtract(resources.justNumbers());
return Node.skew(parent.get().flavor().resources(), free);
}
private boolean isInNodeRepoAndReserved() {
if (isNew) return false;
return state().equals(Node.State.reserved);
}
public static NodeCandidate createChild(Node node,
NodeResources freeParentCapacity,
Node parent,
boolean violatesSpares,
boolean isNew,
boolean isResizeable) {
return new ConcreteNodeCandidate(node, false, freeParentCapacity, Optional.of(parent), violatesSpares, true, false, isNew, isResizeable);
}
public static NodeCandidate createNewChild(NodeResources resources,
NodeResources freeParentCapacity,
Node parent,
boolean violatesSpares,
LockedNodeList allNodes,
IP.Allocation.Context ipAllocationContext) {
return new VirtualNodeCandidate(resources, freeParentCapacity, parent, violatesSpares, true, false, allNodes, ipAllocationContext);
}
public static NodeCandidate createNewExclusiveChild(Node node, Node parent) {
return new ConcreteNodeCandidate(node, false, node.resources(), Optional.of(parent), false, true, false, true, false);
}
public static NodeCandidate createStandalone(Node node, boolean isNew) {
return new ConcreteNodeCandidate(node, false, node.resources(), Optional.empty(), false, true, false, isNew, false);
}
/** A candidate backed by a node */
static class ConcreteNodeCandidate extends NodeCandidate {
private final Node node;
private final boolean retiredNow;
ConcreteNodeCandidate(Node node,
boolean retiredNow,
NodeResources freeParentCapacity, Optional parent,
boolean violatesSpares, boolean exclusiveSwitch, boolean exclusiveParent,
boolean isNew, boolean isResizeable) {
super(freeParentCapacity, parent, violatesSpares, exclusiveSwitch, exclusiveParent, isNew, isResizeable);
this.retiredNow = retiredNow;
this.node = Objects.requireNonNull(node, "Node cannot be null");
}
@Override
public boolean retiredNow() { return retiredNow; }
@Override
public NodeResources resources() { return node.resources(); }
@Override
public Optional parentHostname() { return node.parentHostname(); }
@Override
public NodeType type() { return node.type(); }
@Override
public Optional allocation() { return node.allocation(); }
@Override
public Node.State state() { return node.state(); }
@Override
public boolean wantToRetire() { return node.status().wantToRetire(); }
@Override
public boolean preferToRetire() { return node.status().preferToRetire(); }
@Override
public boolean wantToFail() { return node.status().wantToFail(); }
@Override
public Flavor flavor() { return node.flavor(); }
@Override
public NodeCandidate allocate(ApplicationId owner, ClusterMembership membership, NodeResources requestedResources, Instant at) {
return new ConcreteNodeCandidate(node.allocate(owner, membership, requestedResources, at), retiredNow,
freeParentCapacity, parent, violatesSpares, exclusiveSwitch, exclusiveParent, isNew, isResizable);
}
/** Called when the node described by this candidate must be created */
@Override
public NodeCandidate withNode() { return this; }
@Override
public NodeCandidate withExclusiveSwitch(boolean exclusiveSwitch) {
return new ConcreteNodeCandidate(node, retiredNow, freeParentCapacity, parent, violatesSpares, exclusiveSwitch,
exclusiveParent, isNew, isResizable);
}
@Override
public NodeCandidate withExclusiveParent(boolean exclusiveParent) {
return new ConcreteNodeCandidate(node, retiredNow, freeParentCapacity, parent, violatesSpares, exclusiveSwitch,
exclusiveParent, isNew, isResizable);
}
@Override
public Node toNode() { return node; }
@Override
public boolean isValid() { return true; }
@Override
public int compareTo(NodeCandidate other) {
int comparison = super.compareTo(other);
if (comparison != 0) return comparison;
// Unimportant tie-breaking:
if ( ! (other instanceof ConcreteNodeCandidate)) return -1;
return this.node.hostname().compareTo(((ConcreteNodeCandidate)other).node.hostname());
}
@Override
public String toString() {
return node.id();
}
}
/** A candidate for which no actual node has been created yet */
static class VirtualNodeCandidate extends NodeCandidate {
/** The resources this node must have if created */
private final NodeResources resources;
/** Needed to construct the node */
private final LockedNodeList allNodes;
private final IP.Allocation.Context ipAllocationContext;
private VirtualNodeCandidate(NodeResources resources,
NodeResources freeParentCapacity,
Node parent,
boolean violatesSpares,
boolean exclusiveSwitch,
boolean exclusiveParent,
LockedNodeList allNodes,
IP.Allocation.Context ipAllocationContext) {
super(freeParentCapacity, Optional.of(parent), violatesSpares, exclusiveSwitch, exclusiveParent, true, false);
this.resources = resources;
this.allNodes = allNodes;
this.ipAllocationContext = ipAllocationContext;
}
@Override
public NodeResources resources() { return resources; }
@Override
public Optional parentHostname() { return Optional.of(parent.get().hostname()); }
@Override
public NodeType type() { return NodeType.tenant; }
@Override
public Optional allocation() { return Optional.empty(); }
@Override
public Node.State state() { return Node.State.reserved; }
@Override
public boolean wantToRetire() { return false; }
@Override
public boolean preferToRetire() { return false; }
@Override
public boolean wantToFail() { return false; }
@Override
public Flavor flavor() { return new Flavor(resources); }
@Override
public NodeCandidate allocate(ApplicationId owner, ClusterMembership membership, NodeResources requestedResources, Instant at) {
return withNode().allocate(owner, membership, requestedResources, at);
}
@Override
public NodeCandidate withNode() {
Optional allocation;
try {
allocation = parent.get().ipConfig().pool().findAllocation(ipAllocationContext, allNodes);
if (allocation.isEmpty()) return new InvalidNodeCandidate(resources, freeParentCapacity, parent.get(),
"No addresses available on parent host");
} catch (Exception e) {
log.warning("Failed allocating address on " + parent.get() +": " + Exceptions.toMessageString(e));
return new InvalidNodeCandidate(resources, freeParentCapacity, parent.get(),
"Failed when allocating address on host");
}
Node node = Node.reserve(allocation.get().addresses(),
allocation.get().hostname(),
parentHostname().get(),
resources.with(parent.get().resources().diskSpeed())
.with(parent.get().resources().storageType())
.with(parent.get().resources().architecture()),
NodeType.tenant)
.cloudAccount(parent.get().cloudAccount())
.build();
return new ConcreteNodeCandidate(node, false, freeParentCapacity, parent, violatesSpares, exclusiveSwitch, exclusiveParent, isNew, isResizable);
}
@Override
public NodeCandidate withExclusiveSwitch(boolean exclusiveSwitch) {
return new VirtualNodeCandidate(resources, freeParentCapacity, parent.get(), violatesSpares, exclusiveSwitch, exclusiveParent, allNodes, ipAllocationContext);
}
@Override
public NodeCandidate withExclusiveParent(boolean exclusiveParent) {
return new VirtualNodeCandidate(resources, freeParentCapacity, parent.get(), violatesSpares, exclusiveSwitch, exclusiveParent, allNodes, ipAllocationContext);
}
@Override
public Node toNode() { return withNode().toNode(); }
@Override
public boolean isValid() { return true; }
@Override
public int compareTo(NodeCandidate other) {
int comparison = super.compareTo(other);
if (comparison != 0) return comparison;
// Unimportant tie-breaking:
if ( ! (other instanceof VirtualNodeCandidate)) return 1;
return this.parentHostname().get().compareTo(other.parentHostname().get());
}
@Override
public String toString() {
return "candidate node with " + resources + " on " + parent.get();
}
}
/**
* A candidate which failed to transition from virtual to concrete.
* It will silently stay invalid no matter which method is called on it.
*/
static class InvalidNodeCandidate extends NodeCandidate {
private final NodeResources resources;
private final String invalidReason;
private InvalidNodeCandidate(NodeResources resources, NodeResources freeParentCapacity, Node parent,
String invalidReason) {
super(freeParentCapacity, Optional.of(parent), false, false, false, true, false);
this.resources = resources;
this.invalidReason = invalidReason;
}
@Override
public NodeResources resources() { return resources; }
@Override
public Optional parentHostname() { return Optional.of(parent.get().hostname()); }
@Override
public NodeType type() { return NodeType.tenant; }
@Override
public Optional allocation() { return Optional.empty(); }
@Override
public Node.State state() { return Node.State.reserved; }
@Override
public boolean wantToRetire() { return false; }
@Override
public boolean preferToRetire() { return false; }
@Override
public boolean wantToFail() { return false; }
@Override
public Flavor flavor() { return new Flavor(resources); }
@Override
public NodeCandidate allocate(ApplicationId owner, ClusterMembership membership, NodeResources requestedResources, Instant at) {
return this;
}
@Override
public NodeCandidate withNode() {
return this;
}
@Override
public NodeCandidate withExclusiveSwitch(boolean exclusiveSwitch) {
return this;
}
@Override
public NodeCandidate withExclusiveParent(boolean exclusiveParent) {
return this;
}
@Override
public Node toNode() {
throw new IllegalStateException("Candidate node on " + parent.get() + " is invalid: " + invalidReason);
}
@Override
public boolean isValid() { return false; }
@Override
public int compareTo(NodeCandidate other) {
return 1;
}
@Override
public String toString() {
return "invalid candidate node with " + resources + " on " + parent.get();
}
}
public enum ExclusivityViolation {
NONE, YES,
/** No violation IF AND ONLY IF the parent host's exclusiveToApplicationId is set to this application. */
PARENT_HOST_NOT_EXCLUSIVE
}
public ExclusivityViolation violatesExclusivity(ClusterSpec cluster, ApplicationId application,
boolean exclusiveClusterType, boolean exclusiveAllocation, boolean exclusiveProvisioning,
boolean hostSharing, NodeList allNodes) {
if (parentHostname().isEmpty()) return ExclusivityViolation.NONE;
if (type() != NodeType.tenant) return ExclusivityViolation.NONE;
if (hostSharing) {
// In zones with shared hosts we require that if any node on the host requires exclusivity,
// then all the nodes on the host must have the same owner.
for (Node nodeOnHost : allNodes.childrenOf(parentHostname().get())) {
if (nodeOnHost.allocation().isEmpty()) continue;
if (exclusiveAllocation || nodeOnHost.allocation().get().membership().cluster().isExclusive()) {
if ( ! nodeOnHost.allocation().get().owner().equals(application)) return ExclusivityViolation.YES;
}
}
} else {
// the parent is exclusive to another cluster type
if ( ! emptyOrEqual(parent.flatMap(Node::exclusiveToClusterType), cluster.type()))
return ExclusivityViolation.YES;
// this cluster requires a parent that was provisioned exclusively for this cluster type
if (exclusiveClusterType && parent.flatMap(Node::exclusiveToClusterType).isEmpty())
return ExclusivityViolation.YES;
// the parent is provisioned for another application
if ( ! emptyOrEqual(parent.flatMap(Node::provisionedForApplicationId), application))
return ExclusivityViolation.YES;
// this cluster requires a parent that was provisioned for this application
if (exclusiveProvisioning && parent.flatMap(Node::provisionedForApplicationId).isEmpty())
return ExclusivityViolation.YES;
// the parent is exclusive to another application
if ( ! emptyOrEqual(parent.flatMap(Node::exclusiveToApplicationId), application))
return ExclusivityViolation.YES;
// this cluster requires exclusivity, but the parent is not exclusive
if (exclusiveAllocation && parent.flatMap(Node::exclusiveToApplicationId).isEmpty())
return canMakeHostExclusive(type(), hostSharing) ?
ExclusivityViolation.PARENT_HOST_NOT_EXCLUSIVE :
ExclusivityViolation.YES;
}
return ExclusivityViolation.NONE;
}
/**
* Whether it is allowed to take a host not exclusive to anyone, and make it exclusive to an application.
* Returns false if {@code makeExclusive} is false, which can be used to guard this feature.
*/
public static boolean canMakeHostExclusive(NodeType type, boolean allowHostSharing) {
return type == NodeType.tenant && !allowHostSharing;
}
}
© 2015 - 2024 Weber Informatics LLC | Privacy Policy