1. 10 Aug, 2010 2 commits
  2. 03 Aug, 2010 1 commit
  3. 26 Jul, 2010 1 commit
  4. 24 Jun, 2010 1 commit
  5. 18 Jun, 2010 1 commit
  6. 28 Sep, 2009 2 commits
  7. 16 Jun, 2009 2 commits
  8. 05 Jun, 2009 1 commit
  9. 20 May, 2009 1 commit
  10. 01 Mar, 2007 1 commit
  11. 01 Dec, 2006 1 commit
  12. 25 Jan, 2006 1 commit
    • Robert Ricci's avatar
      Merge in changes from the assign-devel branch. This includes: · ed3cbc13
      Robert Ricci authored
      Ripping out crope and replacing (almost) all cropes, char*s and
      strings with fstring
      
      Beginnings of XML parser support (not built by default yet).
      
      Significant re-org of code.
      
      Should now compile with the latest gcc.
      
      Putting link information in stored solutions.
      
      Support for fixing interfaces.
      ed3cbc13
  13. 29 Sep, 2005 1 commit
  14. 10 May, 2005 1 commit
  15. 27 Jan, 2005 1 commit
  16. 12 Aug, 2004 2 commits
  17. 11 Aug, 2004 1 commit
  18. 03 Jun, 2004 1 commit
    • Robert Ricci's avatar
      'port' assign to compile under gcc 3 (specifically tested with 3.3.1). · f05e1008
      Robert Ricci authored
      This mostly required messing with the STL #includes.
      
      Still builds under gcc 2.95, and won't be built with 3.3 by default
      until I've spent more time testing it.
      
      One reason for doing this is that gcc 3.3 seems to generate faster
      code from templated functions. Tests so far show that the
      gcc3-compiled binary shaves 15-30% off of assign's runtime.
      
      The other reason for doing this is forward-looking. When we end up
      getting boss running on FreeBSD 5 or a recent Linux distro, the
      compiler is likely to be from the gcc 3 branch.
      f05e1008
  19. 23 Mar, 2004 1 commit
  20. 08 Mar, 2004 1 commit
    • Robert Ricci's avatar
      A faily fundamental change in assign - change the criteria we use · 5a72226d
      Robert Ricci authored
      to accept new solutions, so that we don't give violtions any special
      treatment.
      
      This can greatly reduce 'thrasing' at low scores, allowing assign to
      converge on a solution much faster. For example, in the 1000-node
      topology used for the virtualization paper, assign's runtime dropped
      from nearly two hours to just over half an hour, with no degredation
      in scores found.
      
      You can get the old accept behavior by enabling the
      SPECIAL_VIOLATION_TREATMENT #define, which is on right now (hence, we
      are not using this change yet.)
      
      Here are the pertinent comments from the code:
      
      #ifdef SPECIAL_VIOLATION_TREATMENT
               /*
                * In this ifdef, we always accept new solutions that have fewer
                * violations than the old solution, and when we're trying to
                * determine whether or not to accept a new solution with a higher
                * score, we don't take violations into the account.
                *
                * The problem with this shows up at low temperatures. What can often
                * happen is that we accept a solution with worse violations but a
                * better (or similar) score. Then, if we were to try, say the first
                * solution (or a score-equivalent one) again, we'd accept it again.
                *
                * What this leads to is 'thrashing', where we have a whole lot of
                * variation of scores over time, but are not making any real
                * progress. This prevents the cooling schedule from converging for
                * much, much longer than it should really take.
                */
      #else // no SPECIAL_VIOLATION_TREATMENT
               /*
                * In this branch of the ifdef, we give violations no special
                * treatment when it comes to accepting new solution - we just add
                * them into the score. This makes assign behave in a more 'classic'
                * simulated annealing manner.
                *
                * One consequence, though, is that we have to be more careful with
                * scores. We do not want to be able to get into a situation where
                * adding a violation results in a _lower_ score than a solution with
                * fewer violations.
                */
      5a72226d
  21. 09 Jul, 2003 1 commit
  22. 08 Jul, 2003 1 commit
  23. 20 Jun, 2003 1 commit
  24. 29 May, 2003 1 commit
  25. 16 Apr, 2003 1 commit
    • Robert Ricci's avatar
      Fix PER_VNODE_TT to work with vclasses and emulated links. Now, we can turn it · 690ec56d
      Robert Ricci authored
      on in production!
      
      PER_VNODE_TT handles emulated links by simply adding up the total bandwidth
      consumed by a vnode, and the total bandwidth available on each pnode. Of
      course, this can lead to false positives (knapsack problem), but that's okay,
      because it just means we won't bail up front - we'll have to do the full
      annealing pass before we decide it's unmappable.
      
      PER_VNODE_TT now also tries to figure out why a vnode is not mappable - if
      there are _no_ pclasses that match one of the restrictions, it will print out
      something like:
        *** No possible mapping for nodeA
            Too many links!
        *** No possible mapping for nodeB
            Too much bandwidth on emulated links!
      
      This completes the following two items from assign_todo.txt:
      
      6.   fix PER_VNODE_TT and vclasses
      7.   fix PER_VNODE_TT and emulated vlinks
      690ec56d
  26. 25 Mar, 2003 1 commit
  27. 23 Mar, 2003 1 commit
  28. 21 Mar, 2003 1 commit
  29. 20 Mar, 2003 1 commit
    • Robert Ricci's avatar
      Two changes: · 4c25a593
      Robert Ricci authored
      First, don't select a plink for an emulated link that would cause us
      to go over bandwidth.
      
      Second, make FIX_PLINK_ENDPOINTS the default, and add a #define that
      makes it the default (instead of having to specify it on each plink
      line.)
      4c25a593
  30. 06 Mar, 2003 2 commits
  31. 05 Mar, 2003 1 commit
  32. 10 Feb, 2003 1 commit
  33. 05 Feb, 2003 1 commit
  34. 04 Feb, 2003 1 commit
  35. 03 Jul, 2002 1 commit