Statistics
| Branch: | Tag: | Revision:

root / man / hbal.rst @ 7d81bb8b

History | View | Annotate | Download (28.7 kB)

1
HBAL(1) Ganeti | Version @GANETI_VERSION@
2
=========================================
3

    
4
NAME
5
----
6

    
7
hbal \- Cluster balancer for Ganeti
8

    
9
SYNOPSIS
10
--------
11

    
12
**hbal** {backend options...} [algorithm options...] [reporting options...]
13

    
14
**hbal** \--version
15

    
16

    
17
Backend options:
18

    
19
{ **-m** *cluster* | **-L[** *path* **] [-X]** | **-t** *data-file* |
20
**-I** *path* }
21

    
22
Algorithm options:
23

    
24
**[ \--max-cpu *cpu-ratio* ]**
25
**[ \--min-disk *disk-ratio* ]**
26
**[ -l *limit* ]**
27
**[ -e *score* ]**
28
**[ -g *delta* ]** **[ \--min-gain-limit *threshold* ]**
29
**[ -O *name...* ]**
30
**[ \--no-disk-moves ]**
31
**[ \--no-instance-moves ]**
32
**[ -U *util-file* ]**
33
**[ \--ignore-dynu ]**
34
**[ \--evac-mode ]**
35
**[ \--restricted-migration ]**
36
**[ \--select-instances *inst...* ]**
37
**[ \--exclude-instances *inst...* ]**
38

    
39
Reporting options:
40

    
41
**[ -C[ *file* ] ]**
42
**[ -p[ *fields* ] ]**
43
**[ \--print-instances ]**
44
**[ -S *file* ]**
45
**[ -v... | -q ]**
46

    
47

    
48
DESCRIPTION
49
-----------
50

    
51
hbal is a cluster balancer that looks at the current state of the
52
cluster (nodes with their total and free disk, memory, etc.) and
53
instance placement and computes a series of steps designed to bring
54
the cluster into a better state.
55

    
56
The algorithm used is designed to be stable (i.e. it will give you the
57
same results when restarting it from the middle of the solution) and
58
reasonably fast. It is not, however, designed to be a perfect algorithm:
59
it is possible to make it go into a corner from which it can find no
60
improvement, because it looks only one "step" ahead.
61

    
62
The program accesses the cluster state via Rapi or Luxi. It also
63
requests data over the network from all MonDs with the --mond option.
64
Currently it uses only data produced by CPUload collector.
65

    
66
By default, the program will show the solution incrementally as it is
67
computed, in a somewhat cryptic format; for getting the actual Ganeti
68
command list, use the **-C** option.
69

    
70
ALGORITHM
71
~~~~~~~~~
72

    
73
The program works in independent steps; at each step, we compute the
74
best instance move that lowers the cluster score.
75

    
76
The possible move type for an instance are combinations of
77
failover/migrate and replace-disks such that we change one of the
78
instance nodes, and the other one remains (but possibly with changed
79
role, e.g. from primary it becomes secondary). The list is:
80

    
81
- failover (f)
82
- replace secondary (r)
83
- replace primary, a composite move (f, r, f)
84
- failover and replace secondary, also composite (f, r)
85
- replace secondary and failover, also composite (r, f)
86

    
87
We don't do the only remaining possibility of replacing both nodes
88
(r,f,r,f or the equivalent f,r,f,r) since these move needs an
89
exhaustive search over both candidate primary and secondary nodes, and
90
is O(n*n) in the number of nodes. Furthermore, it doesn't seems to
91
give better scores but will result in more disk replacements.
92

    
93
PLACEMENT RESTRICTIONS
94
~~~~~~~~~~~~~~~~~~~~~~
95

    
96
At each step, we prevent an instance move if it would cause:
97

    
98
- a node to go into N+1 failure state
99
- an instance to move onto an offline node (offline nodes are either
100
  read from the cluster or declared with *-O*; drained nodes are
101
  considered offline)
102
- an exclusion-tag based conflict (exclusion tags are read from the
103
  cluster and/or defined via the *\--exclusion-tags* option)
104
- a max vcpu/pcpu ratio to be exceeded (configured via *\--max-cpu*)
105
- min disk free percentage to go below the configured limit
106
  (configured via *\--min-disk*)
107

    
108
CLUSTER SCORING
109
~~~~~~~~~~~~~~~
110

    
111
As said before, the algorithm tries to minimise the cluster score at
112
each step. Currently this score is computed as a weighted sum of the
113
following components:
114

    
115
- standard deviation of the percent of free memory
116
- standard deviation of the percent of reserved memory
117
- standard deviation of the percent of free disk
118
- count of nodes failing N+1 check
119
- count of instances living (either as primary or secondary) on
120
  offline nodes; in the sense of hbal (and the other htools) drained
121
  nodes are considered offline
122
- count of instances living (as primary) on offline nodes; this
123
  differs from the above metric by helping failover of such instances
124
  in 2-node clusters
125
- standard deviation of the ratio of virtual-to-physical cpus (for
126
  primary instances of the node)
127
- standard deviation of the fraction of the available spindles
128
  (in dedicated mode, spindles represent physical spindles; otherwise
129
  this oversubscribable measure for IO load, and the oversubscription
130
  factor is taken into account when computing the number of available
131
  spindles)
132
- standard deviation of the dynamic load on the nodes, for cpus,
133
  memory, disk and network
134
- standard deviation of the CPU load provided by MonD
135

    
136
The free memory and free disk values help ensure that all nodes are
137
somewhat balanced in their resource usage. The reserved memory helps
138
to ensure that nodes are somewhat balanced in holding secondary
139
instances, and that no node keeps too much memory reserved for
140
N+1. And finally, the N+1 percentage helps guide the algorithm towards
141
eliminating N+1 failures, if possible.
142

    
143
Except for the N+1 failures and offline instances counts, we use the
144
standard deviation since when used with values within a fixed range
145
(we use percents expressed as values between zero and one) it gives
146
consistent results across all metrics (there are some small issues
147
related to different means, but it works generally well). The 'count'
148
type values will have higher score and thus will matter more for
149
balancing; thus these are better for hard constraints (like evacuating
150
nodes and fixing N+1 failures). For example, the offline instances
151
count (i.e. the number of instances living on offline nodes) will
152
cause the algorithm to actively move instances away from offline
153
nodes. This, coupled with the restriction on placement given by
154
offline nodes, will cause evacuation of such nodes.
155

    
156
The dynamic load values need to be read from an external file (Ganeti
157
doesn't supply them), and are computed for each node as: sum of
158
primary instance cpu load, sum of primary instance memory load, sum of
159
primary and secondary instance disk load (as DRBD generates write load
160
on secondary nodes too in normal case and in degraded scenarios also
161
read load), and sum of primary instance network load. An example of
162
how to generate these values for input to hbal would be to track ``xm
163
list`` for instances over a day and by computing the delta of the cpu
164
values, and feed that via the *-U* option for all instances (and keep
165
the other metrics as one). For the algorithm to work, all that is
166
needed is that the values are consistent for a metric across all
167
instances (e.g. all instances use cpu% to report cpu usage, and not
168
something related to number of CPU seconds used if the CPUs are
169
different), and that they are normalised to between zero and one. Note
170
that it's recommended to not have zero as the load value for any
171
instance metric since then secondary instances are not well balanced.
172

    
173
The CPUload from MonD's data collector will be used only if all MonDs
174
are running, otherwise it won't affect the cluster score. Since we can't
175
find the CPU load of each instance, we can assume that the CPU load of
176
an instance is proportional to the number of its vcpus. With this
177
heuristic, instances from nodes with high CPU load will tend to move to
178
nodes with less CPU load.
179

    
180
On a perfectly balanced cluster (all nodes the same size, all
181
instances the same size and spread across the nodes equally), the
182
values for all metrics would be zero. This doesn't happen too often in
183
practice :)
184

    
185
OFFLINE INSTANCES
186
~~~~~~~~~~~~~~~~~
187

    
188
Since current Ganeti versions do not report the memory used by offline
189
(down) instances, ignoring the run status of instances will cause
190
wrong calculations. For this reason, the algorithm subtracts the
191
memory size of down instances from the free node memory of their
192
primary node, in effect simulating the startup of such instances.
193

    
194
EXCLUSION TAGS
195
~~~~~~~~~~~~~~
196

    
197
The exclusion tags mechanism is designed to prevent instances which
198
run the same workload (e.g. two DNS servers) to land on the same node,
199
which would make the respective node a SPOF for the given service.
200

    
201
It works by tagging instances with certain tags and then building
202
exclusion maps based on these. Which tags are actually used is
203
configured either via the command line (option *\--exclusion-tags*)
204
or via adding them to the cluster tags:
205

    
206
\--exclusion-tags=a,b
207
  This will make all instance tags of the form *a:\**, *b:\** be
208
  considered for the exclusion map
209

    
210
cluster tags *htools:iextags:a*, *htools:iextags:b*
211
  This will make instance tags *a:\**, *b:\** be considered for the
212
  exclusion map. More precisely, the suffix of cluster tags starting
213
  with *htools:iextags:* will become the prefix of the exclusion tags.
214

    
215
Both the above forms mean that two instances both having (e.g.) the
216
tag *a:foo* or *b:bar* won't end on the same node.
217

    
218
OPTIONS
219
-------
220

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

    
223
-C, \--print-commands
224
  Print the command list at the end of the run. Without this, the
225
  program will only show a shorter, but cryptic output.
226

    
227
  Note that the moves list will be split into independent steps,
228
  called "jobsets", but only for visual inspection, not for actually
229
  parallelisation. It is not possible to parallelise these directly
230
  when executed via "gnt-instance" commands, since a compound command
231
  (e.g. failover and replace-disks) must be executed
232
  serially. Parallel execution is only possible when using the Luxi
233
  backend and the *-L* option.
234

    
235
  The algorithm for splitting the moves into jobsets is by
236
  accumulating moves until the next move is touching nodes already
237
  touched by the current moves; this means we can't execute in
238
  parallel (due to resource allocation in Ganeti) and thus we start a
239
  new jobset.
240

    
241
-p, \--print-nodes
242
  Prints the before and after node status, in a format designed to allow
243
  the user to understand the node's most important parameters. See the
244
  man page **htools**\(1) for more details about this option.
245

    
246
\--print-instances
247
  Prints the before and after instance map. This is less useful as the
248
  node status, but it can help in understanding instance moves.
249

    
250
-O *name*
251
  This option (which can be given multiple times) will mark nodes as
252
  being *offline*. This means a couple of things:
253

    
254
  - instances won't be placed on these nodes, not even temporarily;
255
    e.g. the *replace primary* move is not available if the secondary
256
    node is offline, since this move requires a failover.
257
  - these nodes will not be included in the score calculation (except
258
    for the percentage of instances on offline nodes)
259

    
260
  Note that algorithm will also mark as offline any nodes which are
261
  reported by RAPI as such, or that have "?" in file-based input in
262
  any numeric fields.
263

    
264
-e *score*, \--min-score=*score*
265
  This parameter denotes the minimum score we are happy with and alters
266
  the computation in two ways:
267

    
268
  - if the cluster has the initial score lower than this value, then we
269
    don't enter the algorithm at all, and exit with success
270
  - during the iterative process, if we reach a score lower than this
271
    value, we exit the algorithm
272

    
273
  The default value of the parameter is currently ``1e-9`` (chosen
274
  empirically).
275

    
276
-g *delta*, \--min-gain=*delta*
277
  Since the balancing algorithm can sometimes result in just very tiny
278
  improvements, that bring less gain that they cost in relocation
279
  time, this parameter (defaulting to 0.01) represents the minimum
280
  gain we require during a step, to continue balancing.
281

    
282
\--min-gain-limit=*threshold*
283
  The above min-gain option will only take effect if the cluster score
284
  is already below *threshold* (defaults to 0.1). The rationale behind
285
  this setting is that at high cluster scores (badly balanced
286
  clusters), we don't want to abort the rebalance too quickly, as
287
  later gains might still be significant. However, under the
288
  threshold, the total gain is only the threshold value, so we can
289
  exit early.
290

    
291
\--no-disk-moves
292
  This parameter prevents hbal from using disk move
293
  (i.e. "gnt-instance replace-disks") operations. This will result in
294
  a much quicker balancing, but of course the improvements are
295
  limited. It is up to the user to decide when to use one or another.
296

    
297
\--no-instance-moves
298
  This parameter prevents hbal from using instance moves
299
  (i.e. "gnt-instance migrate/failover") operations. This will only use
300
  the slow disk-replacement operations, and will also provide a worse
301
  balance, but can be useful if moving instances around is deemed unsafe
302
  or not preferred.
303

    
304
\--evac-mode
305
  This parameter restricts the list of instances considered for moving
306
  to the ones living on offline/drained nodes. It can be used as a
307
  (bulk) replacement for Ganeti's own *gnt-node evacuate*, with the
308
  note that it doesn't guarantee full evacuation.
309

    
310
\--restricted-migration
311
  This parameter disallows any replace-primary moves (frf), as well as
312
  those replace-and-failover moves (rf) where the primary node of the
313
  instance is not drained. If used together with the ``--evac-mode``
314
  option, the only migrations that hbal will do are migrations of
315
  instances off a drained node. This can be useful if during a reinstall
316
  of the base operating system migration is only possible from the old
317
  OS to the new OS.
318

    
319
\--select-instances=*instances*
320
  This parameter marks the given instances (as a comma-separated list)
321
  as the only ones being moved during the rebalance.
322

    
323
\--exclude-instances=*instances*
324
  This parameter marks the given instances (as a comma-separated list)
325
  from being moved during the rebalance.
326

    
327
-U *util-file*
328
  This parameter specifies a file holding instance dynamic utilisation
329
  information that will be used to tweak the balancing algorithm to
330
  equalise load on the nodes (as opposed to static resource
331
  usage). The file is in the format "instance_name cpu_util mem_util
332
  disk_util net_util" where the "_util" parameters are interpreted as
333
  numbers and the instance name must match exactly the instance as
334
  read from Ganeti. In case of unknown instance names, the program
335
  will abort.
336

    
337
  If not given, the default values are one for all metrics and thus
338
  dynamic utilisation has only one effect on the algorithm: the
339
  equalisation of the secondary instances across nodes (this is the
340
  only metric that is not tracked by another, dedicated value, and
341
  thus the disk load of instances will cause secondary instance
342
  equalisation). Note that value of one will also influence slightly
343
  the primary instance count, but that is already tracked via other
344
  metrics and thus the influence of the dynamic utilisation will be
345
  practically insignificant.
346

    
347
\--ignore-dynu
348
  If given, all dynamic utilisation information will be ignored by
349
  assuming it to be 0. This option will take precedence over any data
350
  passed by the ``-U`` option or by the MonDs with the ``--mond`` and
351
  the ``--mond-data`` option.
352

    
353
-S *filename*, \--save-cluster=*filename*
354
  If given, the state of the cluster before the balancing is saved to
355
  the given file plus the extension "original"
356
  (i.e. *filename*.original), and the state at the end of the
357
  balancing is saved to the given file plus the extension "balanced"
358
  (i.e. *filename*.balanced). This allows re-feeding the cluster state
359
  to either hbal itself or for example hspace via the ``-t`` option.
360

    
361
-t *datafile*, \--text-data=*datafile*
362
  Backend specification: the name of the file holding node and instance
363
  information (if not collecting via RAPI or LUXI). This or one of the
364
  other backends must be selected. The option is described in the man
365
  page **htools**\(1).
366

    
367
\--mond
368
  If given the program will query all MonDs to fetch data from the
369
  supported data collectors over the network.
370

    
371
\--mond-data *datafile*
372
  The name of the file holding the data provided by MonD, to override
373
  quering MonDs over the network. This is mostly used for debugging. The
374
  file must be in JSON format and present an array of JSON objects ,
375
  one for every node, with two members. The first member named ``node``
376
  is the name of the node and the second member named ``reports`` is an
377
  array of report objects. The report objects must be in the same format
378
  as produced by the monitoring agent.
379

    
380
-m *cluster*
381
  Backend specification: collect data directly from the *cluster* given
382
  as an argument via RAPI. The option is described in the man page
383
  **htools**\(1).
384

    
385
-L [*path*]
386
  Backend specification: collect data directly from the master daemon,
387
  which is to be contacted via LUXI (an internal Ganeti protocol). The
388
  option is described in the man page **htools**\(1).
389

    
390
-X
391
  When using the Luxi backend, hbal can also execute the given
392
  commands. The execution method is to execute the individual jobsets
393
  (see the *-C* option for details) in separate stages, aborting if at
394
  any time a jobset doesn't have all jobs successful. Each step in the
395
  balancing solution will be translated into exactly one Ganeti job
396
  (having between one and three OpCodes), and all the steps in a
397
  jobset will be executed in parallel. The jobsets themselves are
398
  executed serially.
399

    
400
  The execution of the job series can be interrupted, see below for
401
  signal handling.
402

    
403
-l *N*, \--max-length=*N*
404
  Restrict the solution to this length. This can be used for example
405
  to automate the execution of the balancing.
406

    
407
\--max-cpu=*cpu-ratio*
408
  The maximum virtual to physical cpu ratio, as a floating point number
409
  greater than or equal to one. For example, specifying *cpu-ratio* as
410
  **2.5** means that, for a 4-cpu machine, a maximum of 10 virtual cpus
411
  should be allowed to be in use for primary instances. A value of
412
  exactly one means there will be no over-subscription of CPU (except
413
  for the CPU time used by the node itself), and values below one do not
414
  make sense, as that means other resources (e.g. disk) won't be fully
415
  utilised due to CPU restrictions.
416

    
417
\--min-disk=*disk-ratio*
418
  The minimum amount of free disk space remaining, as a floating point
419
  number. For example, specifying *disk-ratio* as **0.25** means that
420
  at least one quarter of disk space should be left free on nodes.
421

    
422
-G *uuid*, \--group=*uuid*
423
  On an multi-group cluster, select this group for
424
  processing. Otherwise hbal will abort, since it cannot balance
425
  multiple groups at the same time.
426

    
427
-v, \--verbose
428
  Increase the output verbosity. Each usage of this option will
429
  increase the verbosity (currently more than 2 doesn't make sense)
430
  from the default of one.
431

    
432
-q, \--quiet
433
  Decrease the output verbosity. Each usage of this option will
434
  decrease the verbosity (less than zero doesn't make sense) from the
435
  default of one.
436

    
437
-V, \--version
438
  Just show the program version and exit.
439

    
440
SIGNAL HANDLING
441
---------------
442

    
443
When executing jobs via LUXI (using the ``-X`` option), normally hbal
444
will execute all jobs until either one errors out or all the jobs finish
445
successfully.
446

    
447
Since balancing can take a long time, it is possible to stop hbal early
448
in two ways:
449

    
450
- by sending a ``SIGINT`` (``^C``), hbal will register the termination
451
  request, and will wait until the currently submitted jobs finish, at
452
  which point it will exit (with exit code 0 if all jobs finished
453
  correctly, otherwise with exit code 1 as usual)
454

    
455
- by sending a ``SIGTERM``, hbal will immediately exit (with exit code
456
  2\); it is the responsibility of the user to follow up with Ganeti
457
  and check the result of the currently-executing jobs
458

    
459
Note that in any situation, it's perfectly safe to kill hbal, either via
460
the above signals or via any other signal (e.g. ``SIGQUIT``,
461
``SIGKILL``), since the jobs themselves are processed by Ganeti whereas
462
hbal (after submission) only watches their progression. In this case,
463
the user will have to query Ganeti for job results.
464

    
465
EXIT STATUS
466
-----------
467

    
468
The exit status of the command will be zero, unless for some reason the
469
algorithm failed (e.g. wrong node or instance data), invalid command
470
line options, or (in case of job execution) one of the jobs has failed.
471

    
472
Once job execution via Luxi has started (``-X``), if the balancing was
473
interrupted early (via *SIGINT*, or via ``--max-length``) but all jobs
474
executed successfully, then the exit status is zero; a non-zero exit
475
code means that the cluster state should be investigated, since a job
476
failed or we couldn't compute its status and this can also point to a
477
problem on the Ganeti side.
478

    
479
BUGS
480
----
481

    
482
The program does not check all its input data for consistency, and
483
sometime aborts with cryptic errors messages with invalid data.
484

    
485
The algorithm is not perfect.
486

    
487
EXAMPLE
488
-------
489

    
490
Note that these examples are not for the latest version (they don't
491
have full node data).
492

    
493
Default output
494
~~~~~~~~~~~~~~
495

    
496
With the default options, the program shows each individual step and
497
the improvements it brings in cluster score::
498

    
499
    $ hbal
500
    Loaded 20 nodes, 80 instances
501
    Cluster is not N+1 happy, continuing but no guarantee that the cluster will end N+1 happy.
502
    Initial score: 0.52329131
503
    Trying to minimize the CV...
504
        1. instance14  node1:node10  => node16:node10 0.42109120 a=f r:node16 f
505
        2. instance54  node4:node15  => node16:node15 0.31904594 a=f r:node16 f
506
        3. instance4   node5:node2   => node2:node16  0.26611015 a=f r:node16
507
        4. instance48  node18:node20 => node2:node18  0.21361717 a=r:node2 f
508
        5. instance93  node19:node18 => node16:node19 0.16166425 a=r:node16 f
509
        6. instance89  node3:node20  => node2:node3   0.11005629 a=r:node2 f
510
        7. instance5   node6:node2   => node16:node6  0.05841589 a=r:node16 f
511
        8. instance94  node7:node20  => node20:node16 0.00658759 a=f r:node16
512
        9. instance44  node20:node2  => node2:node15  0.00438740 a=f r:node15
513
       10. instance62  node14:node18 => node14:node16 0.00390087 a=r:node16
514
       11. instance13  node11:node14 => node11:node16 0.00361787 a=r:node16
515
       12. instance19  node10:node11 => node10:node7  0.00336636 a=r:node7
516
       13. instance43  node12:node13 => node12:node1  0.00305681 a=r:node1
517
       14. instance1   node1:node2   => node1:node4   0.00263124 a=r:node4
518
       15. instance58  node19:node20 => node19:node17 0.00252594 a=r:node17
519
    Cluster score improved from 0.52329131 to 0.00252594
520

    
521
In the above output, we can see:
522

    
523
- the input data (here from files) shows a cluster with 20 nodes and
524
  80 instances
525
- the cluster is not initially N+1 compliant
526
- the initial score is 0.52329131
527

    
528
The step list follows, showing the instance, its initial
529
primary/secondary nodes, the new primary secondary, the cluster list,
530
and the actions taken in this step (with 'f' denoting failover/migrate
531
and 'r' denoting replace secondary).
532

    
533
Finally, the program shows the improvement in cluster score.
534

    
535
A more detailed output is obtained via the *-C* and *-p* options::
536

    
537
    $ hbal
538
    Loaded 20 nodes, 80 instances
539
    Cluster is not N+1 happy, continuing but no guarantee that the cluster will end N+1 happy.
540
    Initial cluster status:
541
    N1 Name   t_mem f_mem r_mem t_dsk f_dsk pri sec  p_fmem  p_fdsk
542
     * node1  32762  1280  6000  1861  1026   5   3 0.03907 0.55179
543
       node2  32762 31280 12000  1861  1026   0   8 0.95476 0.55179
544
     * node3  32762  1280  6000  1861  1026   5   3 0.03907 0.55179
545
     * node4  32762  1280  6000  1861  1026   5   3 0.03907 0.55179
546
     * node5  32762  1280  6000  1861   978   5   5 0.03907 0.52573
547
     * node6  32762  1280  6000  1861  1026   5   3 0.03907 0.55179
548
     * node7  32762  1280  6000  1861  1026   5   3 0.03907 0.55179
549
       node8  32762  7280  6000  1861  1026   4   4 0.22221 0.55179
550
       node9  32762  7280  6000  1861  1026   4   4 0.22221 0.55179
551
     * node10 32762  7280 12000  1861  1026   4   4 0.22221 0.55179
552
       node11 32762  7280  6000  1861   922   4   5 0.22221 0.49577
553
       node12 32762  7280  6000  1861  1026   4   4 0.22221 0.55179
554
       node13 32762  7280  6000  1861   922   4   5 0.22221 0.49577
555
       node14 32762  7280  6000  1861   922   4   5 0.22221 0.49577
556
     * node15 32762  7280 12000  1861  1131   4   3 0.22221 0.60782
557
       node16 32762 31280     0  1861  1860   0   0 0.95476 1.00000
558
       node17 32762  7280  6000  1861  1106   5   3 0.22221 0.59479
559
     * node18 32762  1280  6000  1396   561   5   3 0.03907 0.40239
560
     * node19 32762  1280  6000  1861  1026   5   3 0.03907 0.55179
561
       node20 32762 13280 12000  1861   689   3   9 0.40535 0.37068
562

    
563
    Initial score: 0.52329131
564
    Trying to minimize the CV...
565
        1. instance14  node1:node10  => node16:node10 0.42109120 a=f r:node16 f
566
        2. instance54  node4:node15  => node16:node15 0.31904594 a=f r:node16 f
567
        3. instance4   node5:node2   => node2:node16  0.26611015 a=f r:node16
568
        4. instance48  node18:node20 => node2:node18  0.21361717 a=r:node2 f
569
        5. instance93  node19:node18 => node16:node19 0.16166425 a=r:node16 f
570
        6. instance89  node3:node20  => node2:node3   0.11005629 a=r:node2 f
571
        7. instance5   node6:node2   => node16:node6  0.05841589 a=r:node16 f
572
        8. instance94  node7:node20  => node20:node16 0.00658759 a=f r:node16
573
        9. instance44  node20:node2  => node2:node15  0.00438740 a=f r:node15
574
       10. instance62  node14:node18 => node14:node16 0.00390087 a=r:node16
575
       11. instance13  node11:node14 => node11:node16 0.00361787 a=r:node16
576
       12. instance19  node10:node11 => node10:node7  0.00336636 a=r:node7
577
       13. instance43  node12:node13 => node12:node1  0.00305681 a=r:node1
578
       14. instance1   node1:node2   => node1:node4   0.00263124 a=r:node4
579
       15. instance58  node19:node20 => node19:node17 0.00252594 a=r:node17
580
    Cluster score improved from 0.52329131 to 0.00252594
581

    
582
    Commands to run to reach the above solution:
583
      echo step 1
584
      echo gnt-instance migrate instance14
585
      echo gnt-instance replace-disks -n node16 instance14
586
      echo gnt-instance migrate instance14
587
      echo step 2
588
      echo gnt-instance migrate instance54
589
      echo gnt-instance replace-disks -n node16 instance54
590
      echo gnt-instance migrate instance54
591
      echo step 3
592
      echo gnt-instance migrate instance4
593
      echo gnt-instance replace-disks -n node16 instance4
594
      echo step 4
595
      echo gnt-instance replace-disks -n node2 instance48
596
      echo gnt-instance migrate instance48
597
      echo step 5
598
      echo gnt-instance replace-disks -n node16 instance93
599
      echo gnt-instance migrate instance93
600
      echo step 6
601
      echo gnt-instance replace-disks -n node2 instance89
602
      echo gnt-instance migrate instance89
603
      echo step 7
604
      echo gnt-instance replace-disks -n node16 instance5
605
      echo gnt-instance migrate instance5
606
      echo step 8
607
      echo gnt-instance migrate instance94
608
      echo gnt-instance replace-disks -n node16 instance94
609
      echo step 9
610
      echo gnt-instance migrate instance44
611
      echo gnt-instance replace-disks -n node15 instance44
612
      echo step 10
613
      echo gnt-instance replace-disks -n node16 instance62
614
      echo step 11
615
      echo gnt-instance replace-disks -n node16 instance13
616
      echo step 12
617
      echo gnt-instance replace-disks -n node7 instance19
618
      echo step 13
619
      echo gnt-instance replace-disks -n node1 instance43
620
      echo step 14
621
      echo gnt-instance replace-disks -n node4 instance1
622
      echo step 15
623
      echo gnt-instance replace-disks -n node17 instance58
624

    
625
    Final cluster status:
626
    N1 Name   t_mem f_mem r_mem t_dsk f_dsk pri sec  p_fmem  p_fdsk
627
       node1  32762  7280  6000  1861  1026   4   4 0.22221 0.55179
628
       node2  32762  7280  6000  1861  1026   4   4 0.22221 0.55179
629
       node3  32762  7280  6000  1861  1026   4   4 0.22221 0.55179
630
       node4  32762  7280  6000  1861  1026   4   4 0.22221 0.55179
631
       node5  32762  7280  6000  1861  1078   4   5 0.22221 0.57947
632
       node6  32762  7280  6000  1861  1026   4   4 0.22221 0.55179
633
       node7  32762  7280  6000  1861  1026   4   4 0.22221 0.55179
634
       node8  32762  7280  6000  1861  1026   4   4 0.22221 0.55179
635
       node9  32762  7280  6000  1861  1026   4   4 0.22221 0.55179
636
       node10 32762  7280  6000  1861  1026   4   4 0.22221 0.55179
637
       node11 32762  7280  6000  1861  1022   4   4 0.22221 0.54951
638
       node12 32762  7280  6000  1861  1026   4   4 0.22221 0.55179
639
       node13 32762  7280  6000  1861  1022   4   4 0.22221 0.54951
640
       node14 32762  7280  6000  1861  1022   4   4 0.22221 0.54951
641
       node15 32762  7280  6000  1861  1031   4   4 0.22221 0.55408
642
       node16 32762  7280  6000  1861  1060   4   4 0.22221 0.57007
643
       node17 32762  7280  6000  1861  1006   5   4 0.22221 0.54105
644
       node18 32762  7280  6000  1396   761   4   2 0.22221 0.54570
645
       node19 32762  7280  6000  1861  1026   4   4 0.22221 0.55179
646
       node20 32762 13280  6000  1861  1089   3   5 0.40535 0.58565
647

    
648
Here we see, beside the step list, the initial and final cluster
649
status, with the final one showing all nodes being N+1 compliant, and
650
the command list to reach the final solution. In the initial listing,
651
we see which nodes are not N+1 compliant.
652

    
653
The algorithm is stable as long as each step above is fully completed,
654
e.g. in step 8, both the migrate and the replace-disks are
655
done. Otherwise, if only the migrate is done, the input data is
656
changed in a way that the program will output a different solution
657
list (but hopefully will end in the same state).
658

    
659
.. vim: set textwidth=72 :
660
.. Local Variables:
661
.. mode: rst
662
.. fill-column: 72
663
.. End: