x/bareon-allocator
Code Issues Proposed changes

Add improvments list to readme

Browse Source
This commit is contained in:
Evgeniy L 2015-12-29 21:07:15 +03:00
parent 7951316a76
commit 7c4c4ad3cf
1 changed files with 9 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
README.rst
View File

@ -1,6 +1,6 @@
===============================
========================
bareon-dynamic-allocator
===============================
========================
A driver for Bareon for dynamic allocation of volumes
@ -21,8 +21,11 @@ Features
Future Improvments
------------------
* user weight if max is not specified
* if min and max for several spaces are the same, consider using weight
* create special types, like lv_mirror with special policy to allocate volume
of the same size over several disks
* 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`)
* as a user I should be able to define a single disk partition (http://math.stackexchange.com/questions/1460350/formulation-of-mutually-exclusive-condition, http://people.brunel.ac.uk/~mastjjb/jeb/or/moreip.html)