History | View | Annotate | Download (23.2 kB)
Compute the p_mem / p_dsk statically
This patch changes the computation of p_mem / p_dsk from on-demand(whenever the cluster stats are computed) to after-modify (after a nodeis modified, we update its stats). This brings a god speed-up as onlyone node or two are usually changed between cluster-wide stats are...
Documentation updates
Simplify the checkInstanceMove function
This patch flattens the two folds into one, by simply building the wholelist of moves instead of the double recursion (nodes and the eachnode's moves). This has no functional change, but it's much cleaner.
A small optimization in node computation
Currently we always compute the available node list for moves (for aninstances) based on the nodes of the initial table. This works find,however is a repeated calculation.
We optimize this by passing a node list (of indexes, not full objects),...
Replace a foldl by foldl'
Split checkMove into two
This cleans up and splits the individual instance move into a separate function.
Change the balancing algorithm
This patch changes the balancing algorithm to not iterate linearly overthe instances (in a random, but fixed order), instead selecting at eachstep the best next move. This should allow a better score (most of thetime), and usually also a shorter solution.
Fix a bug in Cluster.fixNodes
We need to lookup the moving accumulator, of course.
Change the input file formats
This patch changes the format of the input node and instance lists. Itremoves the list of primary and secondary instances from the nodes, andadds the primary and secondary nodes to the instance list.
This is done so that we can have the same input data from commands as...
Initial import
This is the initial import of release 0.0.3.