English  |  正體中文  |  简体中文  |  Items with full text/Total items : 87250/116256 (75%)
Visitors : 23290719      Online Users : 90
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 商學院 > 資訊管理學系 > 期刊論文 >  Item 140.119/72841
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/72841


    Title: Unfolding of Multirate Data-Flow Graph to Compute Iteration Bound
    Authors: 趙玉
    Chao, Daniel Yuh
    Contributors: 資管系
    Keywords: Concurrent Processing;Data Flow Graph (DFG);iteration bound;Petri nets
    Date: 2009-04
    Issue Date: 2015-01-12 15:35:20 (UTC+8)
    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.
    Relation: International Journal of Electrical Engineering (IJEE),16(2),159-170
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1007/978-3-642-03095-6_44
    DOI: 10.1007/978-3-642-03095-6_44
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    159-170.pdf248KbAdobe PDF613View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback