Algorithm for finding an available node
• Find the district with the most available UUIDs.
• Find the nodes within that district that have the least active_capacity.
• If some nodes still have active capacity, randomly pick one of the nodes with the lower levels of active_capacity.
• If no nodes in that district have active capacity, find nodes within any district (with available UUIDs) that have available capacity and randomly pick one of the nodes with the lower levels of active_capacity.
This algorithm means that applications are created on the districts with the most available UUIDs first, and districts that have available, non-active capacity are preferred.
Given a set of nodes, when new gears are about to be created, what is the algorithm used to select the node?
If brand new nodes/VM's are added later, how do those new nodes get discovered and made available to haproxy for future gear creation on those nodes? Does the mcollective in broker periodically send messages to discover new nodes or figure out if nodes are gone?
dev mailing list
dev lists openshift redhat com