Iustin Pop [Sun, 22 Feb 2009 12:15:12 +0000 (13:15 +0100)]
A no-code change s/disk/dsk/
This just makes indendation nicer in many expressions.
Iustin Pop [Sun, 22 Feb 2009 12:05:08 +0000 (13:05 +0100)]
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 node
is modified, we update its stats). This brings a god speed-up as only
one node or two are usually changed between cluster-wide stats are
computed.
Iustin Pop [Sun, 15 Feb 2009 13:53:38 +0000 (14:53 +0100)]
Documentation updates
Iustin Pop [Sun, 15 Feb 2009 13:48:39 +0000 (14:48 +0100)]
Simplify the checkInstanceMove function
This patch flattens the two folds into one, by simply building the whole
list of moves instead of the double recursion (nodes and the each
node's moves). This has no functional change, but it's much cleaner.
Iustin Pop [Sun, 15 Feb 2009 13:40:42 +0000 (14:40 +0100)]
A small optimization in node computation
Currently we always compute the available node list for moves (for an
instances) 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),
which helps in two ways:
- faster to filter later
- allows restriction of target nodes by enforcing only this subset as
target for moves
Iustin Pop [Sun, 15 Feb 2009 13:40:13 +0000 (14:40 +0100)]
Container: add a 'keys' function
Iustin Pop [Sun, 15 Feb 2009 13:35:53 +0000 (14:35 +0100)]
Replace a foldl by foldl'
Iustin Pop [Sun, 15 Feb 2009 13:10:41 +0000 (14:10 +0100)]
Split checkMove into two
This cleans up and splits the individual instance move into a separate function.
Iustin Pop [Sat, 14 Feb 2009 21:22:26 +0000 (22:22 +0100)]
Change the balancing algorithm
This patch changes the balancing algorithm to not iterate linearly over
the instances (in a random, but fixed order), instead selecting at each
step the best next move. This should allow a better score (most of the
time), and usually also a shorter solution.
Iustin Pop [Sat, 14 Feb 2009 08:05:06 +0000 (09:05 +0100)]
Add RAPI support to hn1
This patch moves a function to Utils and changes hn1 to be able to take
data from RAPI.
Iustin Pop [Sat, 14 Feb 2009 08:00:56 +0000 (09:00 +0100)]
Implement oneline-output for hbal
Iustin Pop [Sat, 14 Feb 2009 07:51:15 +0000 (08:51 +0100)]
Do not try both http and https against the server
This patch changes the tryRapi function so that if the http request
succeeded, we don't try https too.
Iustin Pop [Sat, 14 Feb 2009 07:46:16 +0000 (08:46 +0100)]
Simplify some JSON transforms
... hopefully this is more clear.
Iustin Pop [Fri, 13 Feb 2009 21:26:23 +0000 (22:26 +0100)]
Add compatibility with rapi v1
The patch adds compatibility with RAPI v1, and this required some new
JSON functions as valFromObj doesn't behave nicely.
Some other unrelated changes were done too.
Iustin Pop [Fri, 13 Feb 2009 08:28:57 +0000 (09:28 +0100)]
Implement reading data from RAPI v2
Iustin Pop [Fri, 13 Feb 2009 08:27:55 +0000 (09:27 +0100)]
Some more utility functions
Iustin Pop [Fri, 13 Feb 2009 08:26:13 +0000 (09:26 +0100)]
Fix a bug in Cluster.fixNodes
We need to lookup the moving accumulator, of course.
Iustin Pop [Thu, 12 Feb 2009 20:14:17 +0000 (21:14 +0100)]
Make RAPI return the same data format as gnt-*
This patch changes the RAPI endpoint return the same data format as the
input files. This will allow using it instead of the files.
Iustin Pop [Thu, 12 Feb 2009 19:55:51 +0000 (20:55 +0100)]
Change the input file formats
This patch changes the format of the input node and instance lists. It
removes the list of primary and secondary instances from the nodes, and
adds the primary and secondary nodes to the instance list.
This is done so that we can have the same input data from commands as
from the RAPI.
Iustin Pop [Wed, 11 Feb 2009 20:37:42 +0000 (21:37 +0100)]
Initial support for reading from RAPI
Iustin Pop [Wed, 28 Jan 2009 11:09:09 +0000 (12:09 +0100)]
Initial import
This is the initial import of release 0.0.3.