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.
Original language | English |
---|---|
Title of host publication | Proceedings of the ASP-DAC 2009 |
Subtitle of host publication | Asia and South Pacific Design Automation Conference 2009 |
Pages | 715-720 |
Number of pages | 6 |
DOIs | |
Publication status | Published - 20 Apr 2009 |
Externally published | Yes |
Event | Asia and South Pacific Design Automation Conference 2009, ASP-DAC 2009 - Yokohama, Japan Duration: 19 Jan 2009 → 22 Jan 2009 |
Conference
Conference | Asia and South Pacific Design Automation Conference 2009, ASP-DAC 2009 |
---|---|
Country/Territory | Japan |
City | Yokohama |
Period | 19/01/09 → 22/01/09 |
ASJC Scopus subject areas
- Computer Science Applications
- Computer Graphics and Computer-Aided Design
- Electrical and Electronic Engineering