Synthesis of Heterogeneous Dataflow Models from Synchronous Specifications

Author(s):  
Omair Rafique ◽  
Yu Bai ◽  
Klaus Schneider ◽  
Guangxi Yan
Keyword(s):  
Author(s):  
Ilya Chukhman ◽  
Shuoxin Lin ◽  
William Plishker ◽  
Chung-Ching Shen ◽  
Shuvra S. Bhattacharyya

Dataflow modeling offers a myriad of tools to improve optimization and analysis of signal processing applications, and is often used by designers to help design, implement, and maintain systems on chip for signal processing. However, maintaining and upgrading legacy systems that were not originally designed using dataflow methods can be challenging. Designers often convert legacy code to dataflow graphs by hand, a process that can be difficult and time consuming. In this paper, the authors developed a method to facilitate this conversion process by automatically detecting the dataflow models of the core functions from bodies of legacy code. They focus first on detecting static dataflow models, such as homogeneous and synchronous dataflow, and then present an extension that can also detect dynamic dataflow models. Building on the authors’ algorithms for dataflow model detection, they present an iterative actor partitioning process that can be used to partition complex actors into simpler sub-functions that are more prone to analysis techniques.


Author(s):  
Jani Boutellier ◽  
Veeranjaneyulu Sadhanala ◽  
Christophe Lucarz ◽  
Philip Brisk ◽  
Marco Mattavelli

2017 ◽  
Vol 22 (2) ◽  
pp. 1-25 ◽  
Author(s):  
Adnan Bouakaz ◽  
Pascal Fradet ◽  
Alain Girault

Author(s):  
Matthieu Wipliez ◽  
Mickaël Raulet

Dataflow programming has been used to describe signal processing applications for many years, traditionally with cyclo-static dataflow (CSDF) or synchronous dataflow (SDF) models that restrict expressive power in favor of compile-time analysis and predictability. More recently, dynamic dataflow is being used for the description of multimedia video standards as promoted by the RVC standard (ISO/IEC 23001:4). Dynamic dataflow is not restricted with respect to expressive power, but it does require runtime scheduling in the general case, which may be costly to perform on software. The authors presented in a previous paper a method to automatically classify actors of a dynamic dataflow program within more restrictive dataflow models when possible, along with a method to transform the actors classified as static to improve execution speed by reducing the number of FIFO accesses (Wipliez & Raulet, 2010). This paper presents an extension of the classification method using satisfiability solving, and details the precise semantics used for the abstract interpretation of actors. The extended classification is able to classify more actors than what could previously be achieved.


Sign in / Sign up

Export Citation Format

Share Document