*banner
 

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

Citation
Stavros Tripakis, Dai Bui, Marc Geilen, Bert Rodiers, Edward A. Lee. "Compositionality in Synchronous Data Flow: Modular Code Generation from Hierarchical SDF Graphs". Technical report, UC Berkeley, UCB/EECS-2010-52, May, 2010; To appear in ACM Transactions on Embedded Computing Systems (TECS).

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 rate inconsistency or deadlock. Motivated by the need for incremental and modular code generation from hierarchical SDF models, we introduce in this paper DSSF profiles. DSSF (Deterministic SDF with Shared FIFOs) 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 (maintaining necessary information to preserve rate consistency and deadlock-absence) 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, Marc Geilen, Bert Rodiers, Edward
    A. Lee. <a
    href="http://chess.eecs.berkeley.edu/pubs/668.html"
    ><i>Compositionality in Synchronous Data Flow:
    Modular Code Generation from Hierarchical SDF
    Graphs</i></a>, Technical report,  UC Berkeley,
    UCB/EECS-2010-52, May, 2010; To appear in ACM Transactions
    on Embedded Computing Systems (TECS).
  • Plain text
    Stavros Tripakis, Dai Bui, Marc Geilen, Bert Rodiers, Edward
    A. Lee. "Compositionality in Synchronous Data Flow:
    Modular Code Generation from Hierarchical SDF Graphs".
    Technical report,  UC Berkeley, UCB/EECS-2010-52, May, 2010;
    To appear in ACM Transactions on Embedded Computing Systems
    (TECS).
  • BibTeX
    @techreport{TripakisBuiGeilenRodiersLee10_CompositionalityInSynchronousDataFlowModularCodeGeneration,
        author = {Stavros Tripakis and Dai Bui and Marc Geilen 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-2010-52},
        month = {May},
        year = {2010},
        note = {To appear in ACM Transactions on Embedded
                  Computing Systems (TECS)},
        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 rate inconsistency or deadlock.
                  Motivated by the need for incremental and modular
                  code generation from hierarchical SDF models, we
                  introduce in this paper DSSF profiles. DSSF
                  (Deterministic SDF with Shared FIFOs) 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 (maintaining necessary
                  information to preserve rate consistency and
                  deadlock-absence) 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/668.html}
    }
    

Posted by Stavros Tripakis on 7 May 2010.
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.

You are not logged in 
©2002-2014 Chess