K 10
svn:author
V 4
kris
K 8
svn:date
V 27
2007-07-29T19:41:52.000000Z
K 7
svn:log
V 485
* Revise the machine selection algorithm.  Previously it chose the first
  machine with the lowest number of running jobs.  This worked when the
  clients were all roughly equivalent, but schedules poorly when there
  are some that are much more powerful (e.g. 8-core machines vs UP machines)

* We now compute the ratio of running jobs to maximum jobs and schedule on
  the machine with lowest occupation fraction.  This populates the machines
  to equal fractions of their capacity.

END