Reduction techniques for Synchronous Dataflow graphs

@article{Geilen2009ReductionTF,
  title={Reduction techniques for Synchronous Dataflow graphs},
  author={Marc Geilen},
  journal={2009 46th ACM/IEEE Design Automation Conference},
  year={2009},
  pages={911-916}
}
The Synchronous Dataflow (SDF) model of computation is popular for modelling the timing behaviour of real-time embedded hardware and software systems and applications. It is an essential ingredient of several automated design-flows and design-space exploration tools. The model can be analysed for throughput and latency properties. Although the SDF model is fairly simple, the analysis algorithms are often of high complexity and the models that need to be analysed may be fairly large. This paper… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 20 extracted citations

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Embedded Multiprocessors: Scheduling and Synchronization

  • S. Sriram, S. S. Bhattacharyya
  • 2000
Highly Influential
18 Excerpts

Software Synthesis from Dataflow Graphs

  • S. Bhattacharyya, P. Murthy, E. Lee
  • Kluwer Academic Publishers,
  • 1996
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…