logo
Free, unlimited AI code reviews that run on commit
git-lrc git-lrc GitHub Install Now We'd appreciate a star git-lrc - Free, unlimited AI code reviews that run on commit | Product Hunt git-lrc - Free, unlimited AI code reviews that run on commit | Product Hunt

hail - Ganeti IAllocator plugin

Bugs

       Networks  (as  configured  by  gnt-network(8)) are not taken into account in Ganeti 2.7.  The only way to
       guarantee that they work correctly is having your networks connected to all  nodegroups.   This  will  be
       fixed in a future version.

Configuration

       For  the  tag-exclusion  configuration  (see  the  manpage  of  hbal for more details), the list of which
       instance tags to consider as exclusion tags will be read from the cluster tags, configured as follows:

       • get all cluster tags starting with htools:iextags:

       • use their suffix as the prefix for exclusion tags

       For example, given a cluster tag like htools:iextags:service, all instance tags  of  the  form  service:X
       will  be  considered  as  exclusion  tags,  meaning  that  (e.g.)   two  instances  which both have a tag
       service:foo will not be placed on the same primary node.

Description

       hail  is  a  Ganeti  IAllocator plugin that implements the instance placement and movement using the same
       algorithm as hbal(1).

       The program takes input via a JSON-file containing current cluster state and  the  request  details,  and
       output (on stdout) a JSON-formatted response.  In case of critical failures, the error message is printed
       on stderr and the exit code is changed to show failure.

       If the input file name is - (a single minus sign), then the request data will be read from stdin.

       Apart  from  input  data,  hail  collects  data  over  the network from all MonDs with the --mond option.
       Currently it uses only data produced by the CPUload collector.

   ALGORITHM
       On regular node groups, the program uses a simplified version of the hbal algorithm;  for  allocation  on
       node groups with exclusive storage see below.

       For  single-node allocations (non-mirrored instances), again we select the node which, when chosen as the
       primary node, gives the best score.

       For dual-node allocations (mirrored instances), we chose the best pair; this is the only choice where the
       algorithm is non-trivial with regard to cluster size.

       For relocations, we try to change the secondary node of the instance to all the valid  other  nodes;  the
       node which results in the best cluster score is chosen.

       For  node  changes  (change-node  mode),  we  currently  support DRBD instances only, and all three modes
       (primary changes, secondary changes and all node changes).

       For group moves (change-group mode), again only DRBD is supported, and we compute  the  correct  sequence
       that  will  result in a group change; job failure mid-way will result in a split instance.  The choice of
       node(s) on the target group is based on the group score, and the choice of group is  based  on  the  same
       algorithm as allocations (group with lowest score after placement).

       The deprecated multi-evacuate modes is no longer supported.

       In all cases, the cluster (or group) scoring is identical to the hbal algorithm.

       For  allocation  on  node  groups with exclusive storage, the lost-allocations metrics is used instead to
       determine which node to allocate an instance on.  For a node the allocation vector is the vector of,  for
       each  instance policy interval in decreasing order, the number of instances minimally compliant with that
       interval that still can be placed on that node.  The lost-allocations vector for an instance on a node is
       the difference of the allocation vectors for that node before and after  placing  the  instance  on  that
       node.  The lost-allocations metrics is the lost allocation vector followed by the remaining disk space on
       the chosen node, all compared lexicographically.

Exit Status

       The exist status of the command will be zero, unless for some reason the algorithm fatally  failed  (e.g.
       wrong node or instance data).

Name

       hail - Ganeti IAllocator plugin

Options

       The options that can be passed to the program are as follows:

Reporting Bugs

       Report bugs to the project's issue tracker or contact the developers using the Ganeti mailing list.

See Also

       Ganeti  overview  and  specifications:  ganeti(7)  (general  overview),  ganeti-os-interface(7) (guest OS
       definitions), ganeti-extstorage-interface(7) (external storage providers).

       Ganeti commands: gnt-cluster(8) (cluster-wide commands), gnt-job(8) (job-related  commands),  gnt-node(8)
       (node-related   commands),   gnt-instance(8)   (instance   commands),   gnt-os(8)  (guest  OS  commands),
       gnt-storage(8)  (storage  commands),  gnt-group(8)  (node  group   commands),   gnt-backup(8)   (instance
       import/export commands), gnt-debug(8) (debug commands).

       Ganeti  daemons: ganeti-watcher(8) (automatic instance restarter), ganeti-cleaner(8) (job queue cleaner),
       ganeti-noded(8) (node daemon), ganeti-rapi(8) (remote API daemon).

       Ganeti htools: htools(1) (generic binary), hbal(1) (cluster balancer), hspace(1) (capacity  calculation),
       hail(1) (IAllocator plugin), hscan(1) (data gatherer from remote clusters), hinfo(1) (cluster information
       printer), mon-collector(7) (data collectors interface).

Synopsis

hail [ -tfile | --simulatespec ] [options...]  input-filehail --version

See Also