Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/72841
DC Field | Value | Language |
---|---|---|
dc.contributor | 資管系 | |
dc.creator | 趙玉 | zh_TW |
dc.creator | Chao, Daniel Yuh | |
dc.date | 2009-04 | |
dc.date.accessioned | 2015-01-12T07:35:20Z | - |
dc.date.available | 2015-01-12T07:35:20Z | - |
dc.date.issued | 2015-01-12T07:35:20Z | - |
dc.identifier.uri | http://nccur.lib.nccu.edu.tw/handle/140.119/72841 | - |
dc.description.abstract | Parhietal. find the iteration bound (IB) by considering the equivalent single-rate data-flow graph (SRDFG) N’ of N, which is generally an exponential time task and the transformed SRDFG is much larger (grows exponentially) than the MRDFG. Ito et al. proposed a novel algorithm to remove node/edge redundancies taking extra time and memory, but losing schedule information of removed nodes. We propose to reduce the MRDFG in a loop-wise fashion (reduce the nodes/edges in a loop as a whole) with fewer nodes/edges. The scheduling of nodes in the MRDFG can be derived from that of the reduced SRDFG., where one invocation of a node n corresponds to a consecutive number of invocations of n in the MRDFG. | |
dc.format.extent | 254396 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.relation | International Journal of Electrical Engineering (IJEE),16(2),159-170 | |
dc.subject | Concurrent Processing; Data Flow Graph (DFG); iteration bound; Petri nets | |
dc.title | Unfolding of Multirate Data-Flow Graph to Compute Iteration Bound | |
dc.type | article | en |
dc.identifier.doi | 10.1007/978-3-642-03095-6_44 | en_US |
dc.doi.uri | http://dx.doi.org/10.1007/978-3-642-03095-6_44 | en_US |
item.openairetype | article | - |
item.cerifentitytype | Publications | - |
item.fulltext | With Fulltext | - |
item.grantfulltext | restricted | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
159-170.pdf | 248.43 kB | Adobe PDF2 | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.