Removed done items from readme and added new one
This commit is contained in:
parent
24e453ced9
commit
c38f09c00d
12
README.rst
12
README.rst
@ -13,18 +13,8 @@ Note that this is a hard requirement.
|
||||
* Source: http://git.openstack.org/cgit/openstack/bareon-dynamic-allocator
|
||||
* Bugs: http://bugs.launchpad.net/bareon
|
||||
|
||||
Features
|
||||
--------
|
||||
|
||||
* TODO
|
||||
|
||||
Future Improvments
|
||||
------------------
|
||||
|
||||
* user weight if max is not specified [DONE]
|
||||
* if min and max for several spaces are the same, consider using weight (DONE, but only for max, better design for min is required)
|
||||
* improve weight algorithm, use weights only if minimal size of one disk is not bigger than maximal size of another, otherwise we should notify user about the error
|
||||
* research on YAQL in order to filter the disks by some criteria
|
||||
* we should automatically add Unallocate volume with no constraints, so user can specify volumes with maximal sizes, and the rest of the space will be allocated for Unallocate
|
||||
* create special types, like lv_mirror with special policy to allocate volume of the same size over several disks
|
||||
* add integer constraints (the problem can be solved with integer programming, but it may lead to situation when there are no feasible solution, so for our practical purpose we are going to use naive implementation which is rounding of resulting vectos `x`)
|
||||
* implement less or equal instead of equal for disk size constraint in this case artificial Unallocated space is not going to be required
|
||||
|
Loading…
x
Reference in New Issue
Block a user