Optimized software synthesis for synchronous dataflow

نویسندگان

  • Shuvra S. Bhattacharyya
  • Praveen K. Murthy
  • Edward A. Lee
چکیده

This paper reviews a set of techniques for compiling dataflow-based, graphical programs for embedded signal processing applications into efficient implementations on programmable digital signal processors. This is a critical problem because programmable digital signal processors have very limited amounts of on-chip memory, and the speed and power penalties for using off-chip memory are often prohibitively high for the types of applications, typically embedded systems, where these processors are used. Moreover, off-chip memory typically needs to be static, increasing the system cost considerably. The compiling techniques described in the paper are developed for the synchronous dataflow model of computation, a model that has found widespread use for specifying and prototyping DSP systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Memory-Optimized Software Synthesis from Dataflow Program Graphs with Large Size Data Samples

In multimedia and graphics applications, data samples of nonprimitive type require significant amount of buffer memory. This paper addresses the problem of minimizing the buffer memory requirement for such applications in embedded software synthesis from graphical dataflow programs based on the synchronous dataflow (SDF) model with the given execution order of nodes. We propose a memory minimiz...

متن کامل

Synthesis of distributed systems from synchronous dataflow programs

Synchronous dataflow languages are a popular tool for systems specification in domains such as real-time control and hardware design. The potential benefits are promising: Discrete-time semantics and deterministic concurrency reduce the state-space of parallel designs, and the engineer’s intuition of uniformly progressing physical time is clearly reflected. However, for deriving implementations...

متن کامل

Memory Efficient Software Synthesis from Dataflow Graph

Due to the limited amount of memory resources in embedded systems, minimizing the memory requirements is an important goal of software synthesis. This paper presents a set of techniques to reduce the code and data size for software synthesis from graphical DSP programs based on the synchronous dataflow (SDF) model. By sharing the kernel code among multiple instances of a block, we can further r...

متن کامل

Memory Access Analysis and Optimization for Efficient Streaming Software Synthesis

An important subset of streaming applications can be synthesized from statically-analyzable synchronous dataflow (SDF) models. The software synthesis process typically implements inter-actor communication in form of buffer arrays that are written to/read from by producers/consumers. Due to practical considerations (e.g., actor IPs) and the nature of SDF models, the generated code could contain ...

متن کامل

Memory efficient software synthesis with mixed coding style from dataflow graphs

This paper presents a set of techniques to reduce the code and data sizes for software synthesis from graphical digital signal-processing programs based on the synchronous dataflow model. By sharing the kernel code among multiple instances of a block with a shared function, we can further reduce the code size below the previous results based on inline coding style. A systematic approach also is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997