Revision 266aea94 README
| b/README | ||
|---|---|---|
| 37 | 37 |
|
| 38 | 38 |
For algorithm details and usage, see the man page hbal(1). |
| 39 | 39 |
|
| 40 |
Cluster N+1 solver |
|
| 41 |
~~~~~~~~~~~~~~~~~~ |
|
| 42 |
|
|
| 43 |
This program runs a very simple brute force algorithm over the instance |
|
| 44 |
placement space in order to determine the shortest number of replace-disks |
|
| 45 |
needed to fix the cluster. Note this means we won't get a balanced cluster, |
|
| 46 |
just one that passes N+1 checks. |
|
| 47 |
|
|
| 48 |
For algorithm details and usage, see the man page hn1(1). |
|
| 49 |
|
|
| 50 |
.. note:: This program is deprecated, hbal should be used instead. |
|
| 51 |
|
|
| 52 | 40 |
IAllocator plugin |
| 53 | 41 |
~~~~~~~~~~~~~~~~~ |
| 54 | 42 |
|
| ... | ... | |
| 72 | 60 |
Integration with Ganeti |
| 73 | 61 |
----------------------- |
| 74 | 62 |
|
| 75 |
The ``hbal``, ``hspace`` and ``hn1`` programs can either get their
|
|
| 76 |
input from text files, or online from a cluster via RAPI. For online
|
|
| 77 |
collection via RAPI, the "-m" argument to both hn1 and hbal should
|
|
| 78 |
specify the cluster or master node name. ``hail`` uses the standard
|
|
| 79 |
iallocator API and thus doesn't need any special setup (just needs to
|
|
| 80 |
be installed in the right directory).
|
|
| 63 |
The ``hbal`` and ``hspace`` programs can either get their input from
|
|
| 64 |
text files, or online from a cluster via RAPI. For online collection
|
|
| 65 |
via RAPI, the "-m" argument to both hbal and hspace should specify the
|
|
| 66 |
cluster or master node name. ``hail`` uses the standard iallocator API
|
|
| 67 |
and thus doesn't need any special setup (just needs to be installed in
|
|
| 68 |
the right directory). |
|
| 81 | 69 |
|
| 82 | 70 |
For generating the text files, a separate tool (``hscan``) is provided |
| 83 | 71 |
to automate their gathering if RAPI is available, which is better |
Also available in: Unified diff