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

Authors:
Weichen Liu;Zonghua Gu;Jiang Xu;Yu Wang;Mingxuan Yuan
Affiliations:
Hong Kong University of Science and Technology, Hong Kong, Hong Kong;Zhejiang University, Hangzhou, China;Hong Kong University of Science and Technology, Hong Kong, Hong Kong;Tsinghua University, Beijing, China;Hong Kong University of Science and Technology, Hong Kong, Hong Kong
Venue:
CODES+ISSS '09 Proceedings of the 7th IEEE/ACM international conference on Hardware/software codesign and system synthesis
Year:
2009

Citing 14
Cited 5

Static scheduling of synchronous data flow programs for digital signal processing

IEEE Transactions on Computers
Bounded scheduling of process networks

Bounded scheduling of process networks
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Data memory minimisation for synchronous data flow graphs emulated on DSP-FPGA targets

DAC '97 Proceedings of the 34th annual Design Automation Conference
Directed explicit model checking with HSF-SPIN

SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Software Synthesis from Dataflow Graphs

Software Synthesis from Dataflow Graphs
NuSMV 2: An OpenSource Tool for Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Managing Memory Requirements in the Synthesis of Real-Time Systems from Processing Graphs

RTAS '98 Proceedings of the Fourth IEEE Real-Time Technology and Applications Symposium
Optimized System Synthesis of Complex RT Level Building Blocks from Multirate Dataflow Graphs

Proceedings of the 12th international symposium on System synthesis
Minimising buffer requirements of synchronous dataflow graphs with model checking

Proceedings of the 42nd annual Design Automation Conference
Memory optimal single appearance schedule with dynamic loop count for synchronous dataflow graphs

ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs

Proceedings of the 43rd annual Design Automation Conference
Memory Management for Synthesis of DSP Software

Memory Management for Synthesis of DSP Software
Static Scheduling and Software Synthesis for Dataflow Graphs with Symbolic Model-Checking

RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium

Buffer Optimization and Dispatching Scheme for Embedded Systems with Behavioral Transparency

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Optimizing performance analysis for synchronous dataflow graphs with shared resources

DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Combining computation and communication optimizations in system synthesis for streaming applications

Proceedings of the 2014 ACM/SIGDA international symposium on Field-programmable gate arrays
Methods to explore design space for MPEG RMC codec specifications

Image Communication
High-level dataflow design of signal processing systems for reconfigurable and multicore heterogeneous platforms

Journal of Real-Time Image Processing

Quantified Score

Hi-index	0.00

Visualization

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.