Improving scalability of model-checking for minimizing buffer requirements of synchronous dataflow graphs

Authors:
Nan Guan;Zonghua Gu;Wang Yi;Ge Yu
Affiliations:
Northeastern University, Shenyang, China;Hong Kong Univ. of Sci. and Tech., Hong Kong, China;Uppsala University, Uppsala, Sweden;Northeastern University, Shenyang, China
Venue:
Proceedings of the 2009 Asia and South Pacific Design Automation Conference
Year:
2009

Citing 9
Cited 1

Static scheduling of synchronous data flow programs for digital signal processing

IEEE Transactions on Computers
Software Synthesis from Dataflow Graphs

Software Synthesis from Dataflow Graphs
Minimal Memory Schedules for Dataflow Networks

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
NuSMV 2: An OpenSource Tool for Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
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
SDF^3: SDF For Free

ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
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)

Quantified Score

Hi-index	0.01

Visualization

Abstract

Synchronous Dataflow (SDF) is a well-known model of computation for dataflow-oriented applications such as embedded systems for signal processing and multimedia. It is important to minimize the buffer size requirements of applications generated from SDF graphs, since memory space is often a scarce resource in these systems due to cost or power consumption constraints. Some authors have proposed to use model-checking for finding the minimum buffer size requirements, but the scalability of model-checking is limited by state space explosion. In this paper, we present several techniques for reducing state space size and improving scalability of model-checking by exploiting problem-specific properties of SDF graphs.