跳到主要导航 跳到搜索 跳到主要内容

Improving Scalability of Model-Checking for Minimizing Buffer Requirements of Synchronous Dataflow Graphs

  • Nan Guan*
  • , Zonghua Gu
  • , Wang Yi
  • , Ge Yu
  • *此作品的通讯作者
  • Northeastern University China
  • Hong Kong University of Science and Technology
  • Uppsala University

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

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.

源语言英语
主期刊名Proceedings of the ASP-DAC 2009
主期刊副标题Asia and South Pacific Design Automation Conference 2009
715-720
页数6
DOI
出版状态已出版 - 2009
已对外发布
活动Asia and South Pacific Design Automation Conference 2009, ASP-DAC 2009 - Yokohama, 日本
期限: 19 1月 200922 1月 2009

出版系列

姓名Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

会议

会议Asia and South Pacific Design Automation Conference 2009, ASP-DAC 2009
国家/地区日本
Yokohama
时期19/01/0922/01/09

指纹

探究 'Improving Scalability of Model-Checking for Minimizing Buffer Requirements of Synchronous Dataflow Graphs' 的科研主题。它们共同构成独一无二的指纹。

引用此