Compositionality in Synchronous Data Flow: modular code generation from hierarchical SDF graphs

  • Authors:
  • Stavros Tripakis;Dai Bui;Bert Rodiers;Edward A. Lee

  • Affiliations:
  • University of California, Berkeley;University of California, Berkeley;University of California, Berkeley;University of California, Berkeley

  • Venue:
  • Proceedings of the 1st ACM/IEEE International Conference on Cyber-Physical Systems
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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 (e.g., actor P of Figure 1) cannot be represented as an atomic SDF actor without loss of information that can lead to deadlocks (Figure 2). To solve this problem, we propose in [1] DSSF profiles (Figure 3). 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.