*banner
 

Compositionality in Synchronous Data Flow: Modular Code Generation from Hierarchical SDF Graphs (Poster Abstract)
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 (Poster Abstract)". ACM/IEEE First International Conference on Cyber-Physical Systems, Raj Rajkumar (ed.), April, 2010.

Abstract
A widespread model of computation, particularly suited for signal processing applications, which are often a key element in cyber-physical systems, is Synchronous (or Static) Data Flow (SDF). But 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. To solve this problem, we propose 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 size of the generated profile 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 in Ptolemy II.

Electronic downloads

Citation formats  
  • HTML
    Stavros Tripakis, Dai Bui, Bert Rodiers, Edward A. Lee.
    <a
    href="http://chess.eecs.berkeley.edu/pubs/662.html"
    >Compositionality in Synchronous Data Flow: Modular Code
    Generation from Hierarchical SDF Graphs (Poster
    Abstract)</a>, ACM/IEEE First International Conference
    on Cyber-Physical Systems, Raj Rajkumar (ed.), April, 2010.
  • Plain text
    Stavros Tripakis, Dai Bui, Bert Rodiers, Edward A. Lee.
    "Compositionality in Synchronous Data Flow: Modular
    Code Generation from Hierarchical SDF Graphs (Poster
    Abstract)". ACM/IEEE First International Conference on
    Cyber-Physical Systems, Raj Rajkumar (ed.), April, 2010.
  • BibTeX
    @inproceedings{TripakisBuiRodiersLee10_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
                  (Poster Abstract)},
        booktitle = {ACM/IEEE First International Conference on
                  Cyber-Physical Systems},
        editor = {Raj Rajkumar},
        month = {April},
        year = {2010},
        abstract = {A widespread model of computation, particularly
                  suited for signal processing applications, which
                  are often a key element in cyber-physical systems,
                  is Synchronous (or Static) Data Flow (SDF). But
                  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. To solve this problem, we
                  propose 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 size of the generated
                  profile 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 in Ptolemy II.},
        URL = {http://chess.eecs.berkeley.edu/pubs/662.html}
    }
    

Posted by Stavros Tripakis on 11 Mar 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