| dc.contributor | 資管系 | |
| dc.creator (作者) | 趙玉 | zh_TW |
| dc.creator (作者) | Chao, Daniel Yuh | |
| dc.date (日期) | 2009-04 | |
| dc.date.accessioned | 12-Jan-2015 15:35:20 (UTC+8) | - |
| dc.date.available | 12-Jan-2015 15:35:20 (UTC+8) | - |
| dc.date.issued (上傳時間) | 12-Jan-2015 15:35:20 (UTC+8) | - |
| dc.identifier.uri (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 (DOI) | 10.1007/978-3-642-03095-6_44 | en_US |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1007/978-3-642-03095-6_44 | en_US |
