Weichen Liu
Jiang Xu
ABSTRACT
Synchronous Dataflow (SDF) is a widely-used model of computation for digital signal processing and multimedia applications, which are typically implemented on memory constrained hardware platforms. SDF can be statically analyzed and scheduled, and the memory requirement for correct execution can be predicted at compile time. In this paper, we present an efficient technique based on model-checking for exact analysis of minimal buffer requirement of an SDF graph to guarantee deadlock-free execution. Performance evaluation shows that our approach can achieve significant performance improvements compared to related work.
- http://www.cse.ust.hk/~weichen/sdf_ex.html.Google Scholar
- http://www.es.ele.tue.nl/sadf/.Google Scholar
- M. Ade, R. Lauwereins, and J. A. Peperstraete. Data memory minimisation for synchronous dataflow graphs emulated on DSP-FPGA targets. In Design Automation Conference, pages 64--69, 1997. Google ScholarDigital Library
- S. S. Bhattacharyya, P. K. Murthy, and E. A. Lee. Software Synthesis from Dataflow Graphs. Kluwer Academic Publishers, 1996. Google ScholarDigital Library
- A. Cimatti, E. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani, and A. Tacchella. NuSMV 2: An OpenSource Tool for Symbolic Model Checking. In International Conference on Computer-Aided Verification (CAV), 2002. Google ScholarDigital Library
- S. Edelkamp, A. Lluch-Lafuente, and S. Leue. Directed explicit model checking with hsf-spin. In M. B. Dwyer, editor, SPIN, volume 2057 of Lecture Notes in Computer Science, pages 57--79. Springer, 2001. Google ScholarDigital Library
- M. Geilen, T. Basten, and S. Stuijk. Minimising buffer requirements of synchronous dataflow graphs with model checking. In DAC '05: Proceedings of the 42nd annual conference on Design automation, pages 819--824, New York, NY, USA, 2005. ACM Press. Google ScholarDigital Library
- S. Goddard and K. Jeffay. Managing memory requirements in the synthesis of real-time systems from processing graphs. In Real-Time Technology and Applications Symposium, 1998. Proceedings. Fourth IEEE, pages 59--70, Jun 1998. Google ScholarDigital Library
- Z. Gu, M. Yuan, N. Guan, M. Lv, X. He, Q. Deng, and G. Yu. Static scheduling and software synthesis for dataflow graphs with symbolic model-checking. In RTSS '07: Proceedings of the 28th IEEE International Real-Time Systems Symposium, pages 353--364, Washington, DC, USA, 2007. IEEE Computer Society. Google ScholarDigital Library
- G. J. Holzmann. The model checker spin. IEEE Trans. Software Eng., 23(5):279--295, 1997. Google ScholarDigital Library
- J. Horstmannshoff and H. Meyr. Optimized system synthesis of complex rt level building blocks from multirate dataflow graphs. In ISSS, pages 38--43, 1999. Google ScholarDigital Library
- D. Kim, M. Kim, and S. Ha. A case study of system level specification and software synthesis of multimode multimedia terminal. In ESTImedia, pages 57--64, 2003.Google Scholar
- S. Kwon, H. Jung, and S. Ha. H.264 decoder algorithm specification and simulation in simulink and peace. In International SoC Design Conference, pages 9--12, Oct 2004.Google Scholar
- E. A. Lee and D. G. Messerschmitt. Static scheduling of synchronous data flow programs for digital signal processing. IEEE Trans. Comput., 36(1):24--35, 1987. Google ScholarDigital Library
- P. K. Murthy and S. S. Bhattacharyya. Memory Management for Synthesis of DSP Software. CRC Press, 2006. Google ScholarDigital Library
- H. Oh, N. Dutt, and S. Ha. Memory optimal single appearance schedule with dynamic loop count for synchronous dataflow graphs. In ASP-DAC '06: Proceedings of the 2006 conference on Asia South Pacific design automation, pages 497--502, New York, NY, USA, 2006. ACM Press. Google ScholarDigital Library
- T. M. Parks. Bounded Scheduling of Process Networks. PhD thesis, 1994. Google ScholarDigital Library
- S. Stuijk, M. Geilen, and T. Basten. Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs. Design Automation Conference, 2006 43rd ACM/IEEE, pages 899--904, 24{28 July 2006. Google ScholarDigital Library
Index Terms
- An efficient technique for analysis of minimal buffer requirements of synchronous dataflow graphs with model checking
Recommendations
A comparison of synchronous and cycle-static dataflow
ASILOMAR '95: Proceedings of the 29th Asilomar Conference on Signals, Systems and Computers (2-Volume Set)We compare synchronous dataflow (SDF) and cyclo-static dataflow (CSDF), which are each special cases of a model of computation we call dataflow process networks. In SDF actors have static firing rules: they consume and produce a fixed number of data ...
Efficient simulation of critical synchronous dataflow graphs
DAC '06: Proceedings of the 43rd annual Design Automation ConferenceSimulation and verification using electronic design automation (EDA) tools are key steps in the design process for communication and signal processing systems. The synchronous dataflow (SDF) model of computation is widely used in EDA tools for system ...
Minimising buffer requirements of synchronous dataflow graphs with model checking
DAC '05: Proceedings of the 42nd annual Design Automation ConferenceSignal processing and multimedia applications are often implemented on resource constrained embedded systems. It is therefore important to find implementations that use as little resources as possible. These applications are frequently specified as ...
Comments