*banner
 

Compositionality in Synchronous Data Flow: Modular Code Generation from Hierarchical SDF Graphs
Stavros Tripakis, Dai Bui, Bert Rodiers, Edward A. Lee

Citation
Stavros Tripakis, Dai Bui, Bert Rodiers, Edward A. Lee. "Compositionality in Synchronous Data Flow: Modular Code Generation from Hierarchical SDF Graphs". Technical report, UC Berkeley, UCB/EECS-2009-143, October, 2009; Superceded by http://www.eecs.berkeley.edu/Pubs/TechRpts/2010/EECS-2010-52.html.

Abstract
Hierarchical SDF models are not compositional: a composite SDF actor cannot be represented as an atomic SDF actor without loss of information that can lead to deadlocks. Motivated by the need for incremental and modular code generation from hierarchical SDF models, we introduce in this paper DSSF profiles. This model forms a compositional abstraction of composite actors that can be used for modular compilation. We provide algorithms for automatic synthesis of non-monolithic DSSF profiles of composite actors given DSSF profiles of their sub-actors. We show how different tradeoffs can be explored when synthesizing such profiles, in terms of modularity (keeping the size of the generated DSSF profile small) versus reusability (preserving information necessary to avoid deadlocks) as well as algorithmic complexity. We show that our method guarantees maximal reusability and report on a prototype implementation.

Electronic downloads

Citation formats  
  • HTML
    Stavros Tripakis, Dai Bui, Bert Rodiers, Edward A. Lee.
    <a
    href="http://chess.eecs.berkeley.edu/pubs/617.html"><i>Compositionality
    in Synchronous Data Flow: Modular Code Generation from
    Hierarchical SDF Graphs</i></a>, Technical
    report,  UC Berkeley, UCB/EECS-2009-143, October, 2009;
    Superceded by <a
    href="http://www.eecs.berkeley.edu/Pubs/TechRpts/2010/EECS-2010-52.html"
    >http://www.eecs.berkeley.edu/Pubs/TechRpts/2010/EECS-2010-52.html</a>.
  • Plain text
    Stavros Tripakis, Dai Bui, Bert Rodiers, Edward A. Lee.
    "Compositionality in Synchronous Data Flow: Modular
    Code Generation from Hierarchical SDF Graphs".
    Technical report,  UC Berkeley, UCB/EECS-2009-143, October,
    2009; Superceded by <a
    href="http://www.eecs.berkeley.edu/Pubs/TechRpts/2010/EECS-2010-52.html"
    >http://www.eecs.berkeley.edu/Pubs/TechRpts/2010/EECS-2010-52.html</a>.
  • BibTeX
    @techreport{TripakisBuiRodiersLee09_CompositionalityInSynchronousDataFlowModularCodeGeneration,
        author = {Stavros Tripakis and Dai Bui and Bert Rodiers and
                  Edward A. Lee},
        title = {Compositionality in Synchronous Data Flow: Modular
                  Code Generation from Hierarchical SDF Graphs},
        institution = {UC Berkeley},
        number = {UCB/EECS-2009-143},
        month = {October},
        year = {2009},
        note = {Superceded by <a
                  href="http://www.eecs.berkeley.edu/Pubs/TechRpts/2010/EECS-2010-52.html"
                  >http://www.eecs.berkeley.edu/Pubs/TechRpts/2010/EECS-2010-52.html</a>},
        abstract = {Hierarchical SDF models are not compositional: a
                  composite SDF actor cannot be represented as an
                  atomic SDF actor without loss of information that
                  can lead to deadlocks. Motivated by the need for
                  incremental and modular code generation from
                  hierarchical SDF models, we introduce in this
                  paper DSSF profiles. This model forms a
                  compositional abstraction of composite actors that
                  can be used for modular compilation. We provide
                  algorithms for automatic synthesis of
                  non-monolithic DSSF profiles of composite actors
                  given DSSF profiles of their sub-actors. We show
                  how different tradeoffs can be explored when
                  synthesizing such profiles, in terms of modularity
                  (keeping the size of the generated DSSF profile
                  small) versus reusability (preserving information
                  necessary to avoid deadlocks) as well as
                  algorithmic complexity. We show that our method
                  guarantees maximal reusability and report on a
                  prototype implementation.},
        URL = {http://chess.eecs.berkeley.edu/pubs/617.html}
    }
    

Posted by Stavros Tripakis on 20 Oct 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