Commit d62e12f9 authored by Klaus Aehlig's avatar Klaus Aehlig

shared storage N+1 design: for hspace simply iterate

As it turns out, simply iterating the steps that hail does
is fast enough for shared storage, so that we can have accurate
predictions with hspace.
Signed-off-by: default avatarKlaus Aehlig <aehlig@google.com>
Reviewed-by: default avatarHelga Velroyen <helgav@google.com>
parent 721991ef
......@@ -65,12 +65,11 @@ Modifications to existing tools
on the next move, it will filter out those moves that lead from a
shared storage N+1 redundant configuration into one that isn't.
- ``hspace`` computing the capacity for DRBD instances will be unchanged.
For shared storage instances, however, it will first evacuate one node
and then compute capacity as normal pretending that node was offline.
While this technically deviates from interatively doing what hail does,
it should still give a reasonable estimate of the cluster capacity without
significantly increasing the algorithmic complexity.
- ``hspace`` computing the capacity for DRBD instances will be unchanged;
In particular, the options ``--accept-exisiting`` and ``--independent-groups``
will continue to work. For shared storage instances, however, will strictly
iterate over the same allocation step as hail does.
Other modifications related to opportunistic locking
----------------------------------------------------
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment