*banner
 

New Width Inference Algorithm
Bert Rodiers, Ben Lickly

Citation
Bert Rodiers, Ben Lickly. "New Width Inference Algorithm". Talk or presentation, 12, February, 2009; Poster presented at 2009 Berkeley EECS Annual Research Symposium (BEARS).

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

Citation formats  
  • HTML
    Bert Rodiers, Ben Lickly. <a
    href="http://chess.eecs.berkeley.edu/pubs/572.html"
    ><i>New Width Inference
    Algorithm</i></a>, Talk or presentation,  12,
    February, 2009; Poster presented at 2009 Berkeley EECS
    Annual Research Symposium (BEARS).
  • Plain text
    Bert Rodiers, Ben Lickly. "New Width Inference
    Algorithm". Talk or presentation,  12, February, 2009;
    Poster presented at 2009 Berkeley EECS Annual Research
    Symposium (BEARS).
  • BibTeX
    @presentation{RodiersLickly09_NewWidthInferenceAlgorithm,
        author = {Bert Rodiers and Ben Lickly},
        title = {New Width Inference Algorithm},
        day = {12},
        month = {February},
        year = {2009},
        note = {Poster presented at 2009 Berkeley EECS Annual
                  Research Symposium (BEARS)},
        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/572.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.

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.

©2002-2018 Chess