English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 93861/124308 (76%)
Visitors : 28941729      Online Users : 456
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 PDF645View/Open

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

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback