Multiconstraint Static Scheduling of Synchronous Dataflow Graphs Via Retiming and Unfolding

CORC > 软件研究所 > 软件所图书馆 > 期刊论文

	Multiconstraint Static Scheduling of Synchronous Dataflow Graphs Via Retiming and Unfolding
	Zhu, XY ; Geilen, M ; Basten, T ; Stuijk, S
刊名	IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS
	2016
卷号	35 期号:6 页码:905-918
关键词	Mapping multiconstraint resource optimization scheduling timing optimization
ISSN号	0278-0070
中文摘要	Synchronous dataflow graphs (SDFGs) are widely used to represent digital signal processing algorithms and streaming media applications. This paper presents several methods for binding and scheduling SDFGs on a multiprocessor platform. Exploring the state space generated by a self-timed execution (STE) of an SDFG, we present an exact method for static rate-optimal scheduling of SDFGs via implicit retiming and unfolding. By modeling a constraint as an extra enabling condition for the STE, we get a constrained STE which implies a schedule under the constraint. We present a general framework for scheduling SDFGs under constraints on the number of processors, buffer sizes, auto-concurrency, or combinations of them. Exploring the state space generated by the constrained STE, we can check whether a retiming, which leads to a rate-optimal schedule under the processor (or memory) constraint, exists. Combining this with a binary search strategy, we present heuristic methods to find a proper retiming and a static scheduling that schedules the retimed SDFG with optimal rate and with as few processors (or as little storage space) as possible. None of the methods explicitly converts an SDFG to its equivalent homogenous SDFG, the size of which may be tremendously larger than the original SDFG. We perform experiments on several models of real applications and hundreds of synthetic SDFGs. The results show that the exact method outperforms existing methods significantly; our heuristics reduce the resources used and are computationally efficient.
英文摘要	Synchronous dataflow graphs (SDFGs) are widely used to represent digital signal processing algorithms and streaming media applications. This paper presents several methods for binding and scheduling SDFGs on a multiprocessor platform. Exploring the state space generated by a self-timed execution (STE) of an SDFG, we present an exact method for static rate-optimal scheduling of SDFGs via implicit retiming and unfolding. By modeling a constraint as an extra enabling condition for the STE, we get a constrained STE which implies a schedule under the constraint. We present a general framework for scheduling SDFGs under constraints on the number of processors, buffer sizes, auto-concurrency, or combinations of them. Exploring the state space generated by the constrained STE, we can check whether a retiming, which leads to a rate-optimal schedule under the processor (or memory) constraint, exists. Combining this with a binary search strategy, we present heuristic methods to find a proper retiming and a static scheduling that schedules the retimed SDFG with optimal rate and with as few processors (or as little storage space) as possible. None of the methods explicitly converts an SDFG to its equivalent homogenous SDFG, the size of which may be tremendously larger than the original SDFG. We perform experiments on several models of real applications and hundreds of synthetic SDFGs. The results show that the exact method outperforms existing methods significantly; our heuristics reduce the resources used and are computationally efficient.
收录类别	SCI
语种	英语
WOS记录号	WOS:000377105700003
公开日期	2016-12-09
内容类型	期刊论文
源URL	[http://ir.iscas.ac.cn/handle/311060/17327]
专题	软件研究所_软件所图书馆_期刊论文
推荐引用方式 GB/T 7714	Zhu, XY,Geilen, M,Basten, T,et al. Multiconstraint Static Scheduling of Synchronous Dataflow Graphs Via Retiming and Unfolding[J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS,2016,35(6):905-918.
APA	Zhu, XY,Geilen, M,Basten, T,&Stuijk, S.(2016).Multiconstraint Static Scheduling of Synchronous Dataflow Graphs Via Retiming and Unfolding.IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS,35(6),905-918.
MLA	Zhu, XY,et al."Multiconstraint Static Scheduling of Synchronous Dataflow Graphs Via Retiming and Unfolding".IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 35.6(2016):905-918.