Difference: AndreHolznerFEDBuilder (26 vs. 27)

Revision 272010-10-31 - AndreHolzner

Line: 1 to 1
 
META TOPICPARENT name="AndreHolzner"

My notes on the CMS fedbuilder

Line: 256 to 256
  in http://isscvs.cern.ch/cgi-bin/cvsweb.cgi/TriDAS/RunControl/framework/utilities/hwcfg/fillers/src/rcms/utilities/hwcfg/fillertools/EVBOptimizer.java?rev=1.3;content-type=text%2Fx-cvsweb-markup;cvsroot=tridas
Added:
>
>

2010-10-31

For the 'between same crates' routing problem: each of the links can be used at most twice (or less if some of them are broken). We can formulate this as an integer programming problem (see also http://en.wikipedia.org/wiki/Linear_program#Integer_unknowns ):

maximize

  c^T * x
with constraint
 A * x <= b
where x is the vector of 'how many times a pattern in the above list of 24 patterns is taken' (i.e. has length 24), b is the number of times a link is available (i.e. has length 16) and A_ij is 1 if link i is used in pattern j (or zero if it isn't). Note that this matrix is NOT square. The vector c consists of all ones such that c^T * x is the number of four-patterns included in the solution.

See e.g. also http://www.cs.brown.edu/courses/csci1490/slides/CS149-TUM.pdf

  -- AndreHolzner - 09-Jan-2010
 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright & 2008-2019 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback