Fully static processor optimal assignment of data-flow graphs

Full metadata record

DC Field	Value	Language
dc.contributor.author	Ho, YC	en_US
dc.contributor.author	Tsay, JC	en_US
dc.date.accessioned	2014-12-08T15:01:49Z	-
dc.date.available	2014-12-08T15:01:49Z	-
dc.date.issued	1997-05-01	en_US
dc.identifier.issn	1070-9908	en_US
dc.identifier.uri	http://dx.doi.org/10.1109/97.575560	en_US
dc.identifier.uri	http://hdl.handle.net/11536/583	-
dc.description.abstract	The data-flow graph (DFG) is an important graph-theoretic model for multiprocessor implementation of real-time digital signal processing (DSP) algorithms. Given a time schedule for a DFG,, we consider the problem of the processor-optimal assignment for a fully static schedule. Previously, the solution of this problem was found by solving an integer programming problem. In this letter, we propose a linear programming approach to solving the problem.	en_US
dc.language.iso	en_US	en_US
dc.title	Fully static processor optimal assignment of data-flow graphs	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1109/97.575560	en_US
dc.identifier.journal	IEEE SIGNAL PROCESSING LETTERS	en_US
dc.citation.volume	4	en_US
dc.citation.issue	5	en_US
dc.citation.spage	146	en_US
dc.citation.epage	148	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1997WW85200010	-
dc.citation.woscount	0	-
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.