English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 14539823      Online Users : 62
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU 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

    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/13913

    Title: Efficient emulation for tree-connected networks
    Authors: Shyu,Daw-Jong
    Date: 1994
    Publisher: Institute of Electrical and Electronics Engineers Inc
    Keywords: Interconnection networks
    Parallel processing systems
    Computer simulation
    Parallel algorithms
    Computational complexity
    Electric network topology
    Abstract: Efficient emulations provide general methods to convert algorithms designed on a network into algorithms on smaller networks (with the same interconnection structure). In this paper, an optimal emulation for trees is proposed. With a slight modification, our emulation can be applied to X-trees without loss any efficiency. By the strategy of our emulation, optimal emulations for m-ary trees and pyramids can be obtained. An extended problem of the emulation problem on trees is to emulate a weighted tree, in which every node is associated with a weight, by a smaller tree. In this paper, we also consider the extended problem and show that the problem is NP-hard.
    Relation Link: http://webservices.ieee.org/pindex_basic.html
    URI: http://nthur.lib.nthu.edu.tw/handle/987654321/13913
    Appears in Collections:[資訊工程學系] 會議論文
    [資訊系統與應用研究所] 會議論文
    [電腦與通訊科技研發中心] 會議論文
    [腦科學研究中心] 會議論文

    Files in This Item:

    File Description SizeFormat
    2030209030010.pdf627KbAdobe PDF1369View/Open


    SFX Query


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