1. 31 May, 2005 1 commit
  2. 12 Jul, 2004 1 commit
  3. 16 Jun, 2004 1 commit
  4. 04 Jun, 2004 1 commit
    • Robert Ricci's avatar
      A couple related improvements: · 5e5bea87
      Robert Ricci authored
      Parse the ptop file to get information like colocation factors, CPU
      speeds, trivial bandwidth, and the like, instead of hard coding them.
      
      Keep features and trivial bandwidth by type (ie. pcvm, pcvm850),
      instead of making them the same for all types. This should make
      much better conglomeration choices.
      5e5bea87
  5. 04 May, 2004 3 commits
  6. 03 May, 2004 1 commit
  7. 29 Apr, 2004 1 commit
    • Robert Ricci's avatar
      Make the prepass work with fixed nodes. · bb907b4e
      Robert Ricci authored
      Add a new function, factor_out_fixednodes, that takes a set of nodes
      and a reference to another coarsening function. Seperately coarsens
      the fixed nodes and passes the non-fixed nodes to the other coarsener.
      bb907b4e
  8. 10 Feb, 2004 1 commit
  9. 03 Feb, 2004 1 commit
  10. 29 Jan, 2004 1 commit
    • Robert Ricci's avatar
      New script: assign_prepass · 57c245f5
      Robert Ricci authored
      Acts as a transparent filter for assign - parses the top file given to
      assign, coarsens the graph in it, then feeds that to assign.
      Translates assign's output back into context of the original graph,
      and spits that out for parsing.
      
      Right now, only includes a single coarsening algorithm - conglomerates
      the nodes in leaf lans. Hopefully, it will soon include other
      algorithms, such as running METIS to partition the graph.
      
      Still needs a fair amount of work to be general - only works on
      certain types of topologies right now.
      
      Not called yet, but that will be trivial - just need to change
      assign_wrapper to call assign_prepass instead of assign.
      57c245f5