An efficient technique for analysis of minimal buffer requirements of synchronous dataflow graphs with model checking

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.

[1]  Edward A. Lee,et al.  Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing , 1989, IEEE Transactions on Computers.

[2]  Edward A. Lee,et al.  Software Synthesis from Dataflow Graphs , 1996 .

[3]  Thomas Martyn Parks,et al.  Bounded scheduling of process networks , 1996 .

[4]  Rudy Lauwereins,et al.  Data memory minimisation for synchronous data flow graphs emulated on DSP-FPGA targets , 1997, DAC.

[5]  Gerard J. Holzmann,et al.  The Model Checker SPIN , 1997, IEEE Trans. Software Eng..

[6]  Steve Goddard,et al.  Managing memory requirements in the synthesis of real-time systems from processing graphs , 1998, Proceedings. Fourth IEEE Real-Time Technology and Applications Symposium (Cat. No.98TB100245).

[7]  Heinrich Meyr,et al.  Optimized system synthesis of complex RT level building blocks from multirate dataflow graphs , 1999, Proceedings 12th International Symposium on System Synthesis.

[8]  Stefan Edelkamp,et al.  Directed explicit model checking with HSF-SPIN , 2001, SPIN '01.

[9]  Marco Pistore,et al.  NuSMV 2: An OpenSource Tool for Symbolic Model Checking , 2002, CAV.

[10]  Soonhoi Ha,et al.  A Case Study of System Level Specification and Software Synthesis of Multimode Multimedia Terminal , 2003, ESTImedia.

[11]  Soonhoi Ha,et al.  H.264 Decoder Algorithm Specification and Simulation in Simulink and PeaCE , 2004 .

[12]  S. Ha,et al.  264 Decoder Algorithm Specification and Simulation in Simulink and PeaCE Seongnam , 2004 .

[13]  Sander Stuijk,et al.  Minimising buffer requirements of synchronous dataflow graphs with model checking , 2005, Proceedings. 42nd Design Automation Conference, 2005..

[14]  Soonhoi Ha,et al.  Memory optimal single appearance schedule with dynamic loop count for synchronous dataflow graphs , 2006, Asia and South Pacific Conference on Design Automation, 2006..

[15]  Praveen K. Murthy,et al.  Memory Management for Synthesis of DSP Software , 2006 .

[16]  Sander Stuijk,et al.  Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs , 2006, 2006 43rd ACM/IEEE Design Automation Conference.

[17]  Ge Yu,et al.  Static Scheduling and Software Synthesis for Dataflow Graphs with Symbolic Model-Checking , 2007, 28th IEEE International Real-Time Systems Symposium (RTSS 2007).