1. 20 Oct, 2008 1 commit
  2. 09 Sep, 2008 2 commits
  3. 16 May, 2008 1 commit
  4. 13 May, 2008 2 commits
  5. 12 May, 2008 2 commits
  6. 09 May, 2008 2 commits
  7. 31 Mar, 2008 1 commit
  8. 20 Dec, 2007 1 commit
  9. 17 Dec, 2007 1 commit
    • Robert Ricci's avatar
      Fix for fixed interfaces: move the code that filters interfaces whose · 43333bb7
      Robert Ricci authored
      name's don't match from resolve_link() to find_best_link() - the latter
      returns only one link of each type, so it's too late to find the right
      interface by the time we get back out to resolve_link(). Also fixed
      a built-in assmption about the 'direction' that physical links go in.
      The old code (explicity) assumed that links to from node to switch - now
      we flip around our comparison if the directions of the links do not
      match.
      
      This was a bugger, even though it didn't involve much code, since the
      'flipping' involves a 'parity' issue - it's really easy to mess up the
      parity in several places and get it to work under *some* circumstances.
      
      As a side effect, added some more information to the plink strucutre.
      This turned out to not be necessary for the solution I finally came
      up with - it was part of an earlier, abandoned one. But, it's probably
      good information to have around in the future.
      43333bb7
  10. 05 Jul, 2007 2 commits
  11. 25 Jun, 2007 1 commit
  12. 20 Jun, 2007 1 commit
  13. 29 Mar, 2007 1 commit
  14. 01 Mar, 2007 2 commits
  15. 15 Dec, 2006 1 commit
  16. 01 Dec, 2006 2 commits
  17. 28 Nov, 2006 1 commit
  18. 24 May, 2006 1 commit
  19. 19 May, 2006 2 commits
  20. 05 Apr, 2006 1 commit
  21. 04 Apr, 2006 1 commit
  22. 30 Mar, 2006 1 commit
    • Robert Ricci's avatar
      prune_unusable_pclasses() now goes through the ptypes of the classes · f8b6a77c
      Robert Ricci authored
      it removes, and decrements the available slot count for every node
      in a pclass that is being removed.
      
      After running prune_unusable_pclasses(), we now do another type check,
      minus the pruned pclasses.
      
      This should enable us to detect more free node problems up front -
      let's say there are 8 vnodes that all want 2 interfaces, but only
      a couple pnodes that have 2: most have 1. The second type check will
      now catch this, since all of the 1-interface pnodes have been pruned.
      f8b6a77c
  23. 25 Jan, 2006 3 commits
  24. 16 Dec, 2005 1 commit
    • Robert Ricci's avatar
      The beginnings of a toy version of assign written in Comet. I'm · ef81939b
      Robert Ricci authored
      working on getting a feeling of whether or not it's feasible to
      implement assign in Comet. I think if it is, it would be a huge win in
      terms of maintainability and extensibility.
      
      So far, it's looking very promising. I'm struggling a bit with the
      syntax, and the lack of an API reference. But, once I figure out how
      to do what I need, it's making a lot of sense.
      
      All this program does so far is try to respect the number of slots on
      physical nodes - ie. not assign more than one vnode to a pnode, but it
      can do arbitrary numbers instead of just 1.
      
      It does not read top/ptop files, doesn't know about types, doesn't try
      to minimize any score, doesn't do features/desires, doesn't know about
      links at all, etc. Like I said, it's the beginnings of a toy program.
      
      It looks to me like what we're going to end up doing is writing a
      program to produce Comet programs. One of the cool things about this
      is that it means we can leave out any constraints, etc. that are not
      relevant to the particular mapping problem at hand. And, it should
      make it easy for us to plug in other search techniques (ie. write the
      obvious ones for certain pathological cases, like snakes and
      trees.)
      ef81939b
  25. 29 Sep, 2005 2 commits
  26. 13 Sep, 2005 1 commit
  27. 01 Sep, 2005 2 commits
  28. 29 Aug, 2005 1 commit