Citation
Bert Rodiers, Ben Lickly. "New Width Inference Algorithm". Talk or presentation, 16, April, 2009; Poster presented at the 8th Biennial Ptolemy Miniconference.

Abstract
In Ptolemy II relations can have multiple channels, each one representing a sequence of tokens. The number of channels is specified by the width of a relation. Having to explicitly specify the width for each relation can be a tedious job. To make it even worse, the addition of one relation to a multiport might result in a model builder needing to go through the model again to adapt widths. To cope with this you can set the width to -1. In this case the width of the relation is inferred from other relations or other ports with a graph algorithm. A graph algorithm is often a trade-off between completeness of the algorithm and the complexity of the algorithm. There was already an existing fast implementation that had many limitations and hence we tried to come up with a solution that can infer the width for most scenarios without imposing a large performance cost. The algorithm propagates the widths it knows and at multiports tries to infer the widths of other relations from these propagated widths.

Electronic downloads

• New%20Width%20Inference%20Algorithm.ppt · application/vnd.ms-powerpoint · 870 kbytes

• HTML

  Bert Rodiers, Ben Lickly. <a
  href="http://chess.eecs.berkeley.edu/pubs/571.html"
  ><i>New Width Inference
  Algorithm</i></a>, Talk or presentation,  16,
  April, 2009; Poster presented at the 8th Biennial Ptolemy
  Miniconference.

• Plain text

  Bert Rodiers, Ben Lickly. "New Width Inference
  Algorithm". Talk or presentation,  16, April, 2009;
  Poster presented at the 8th Biennial Ptolemy Miniconference.

• BibTeX

  @presentation{RodiersLickly09_NewWidthInferenceAlgorithm,
      author = {Bert Rodiers and Ben Lickly},
      title = {New Width Inference Algorithm},
      day = {16},
      month = {April},
      year = {2009},
      note = {Poster presented at the 8th Biennial Ptolemy
                Miniconference},
      abstract = {In Ptolemy II relations can have multiple
                channels, each one representing a sequence of
                tokens. The number of channels is specified by the
                width of a relation. Having to explicitly specify
                the width for each relation can be a tedious job.
                To make it even worse, the addition of one
                relation to a multiport might result in a model
                builder needing to go through the model again to
                adapt widths. To cope with this you can set the
                width to -1. In this case the width of the
                relation is inferred from other relations or other
                ports with a graph algorithm. A graph algorithm is
                often a trade-off between completeness of the
                algorithm and the complexity of the algorithm.
                There was already an existing fast implementation
                that had many limitations and hence we tried to
                come up with a solution that can infer the width
                for most scenarios without imposing a large
                performance cost. The algorithm propagates the
                widths it knows and at multiports tries to infer
                the widths of other relations from these
                propagated widths.},
      URL = {http://chess.eecs.berkeley.edu/pubs/571.html}
  }
  

Posted by Bert Rodiers on 18 Apr 2009.
Groups: ptolemy
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.