English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62797/95867 (66%)
Visitors : 3742070      Online Users : 528
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/60702


    Title: A fast recognition-complete processor allocation strategy for hypercube computers
    Authors: 莊博任=Chuang, Po-jen;Tzeng, Nian-feng
    Contributors: 淡江大學電機工程學系
    Keywords: Hypercubes;Binary trees;Topology;Prototypes;Rotation measurement;Supercomputers;Costs;Research and development;Reflective binary codes
    Date: 1992-04
    Issue Date: 2011-10-15 00:44:34 (UTC+8)
    Abstract: Fully recognizing various subcubes in a hypercube computer efficiently is addressed. A method with much less complexity than the multiple-GC strategy in generating the search space, while achieving complete subcube recognition, is proposed. This method is referred to as a dynamic processor allocation scheme because the search space generated is dependent on the dimension of the requested subcube dynamically. The basic idea lies in collapsing the binary tree representations of a hypercube successively so that the nodes which form a subcube but are distant are brought close to each other for recognition. The strategy can be implemented efficiently by using right rotating operations on the notations of the sets of subcubes corresponding to the nodes at a certain level of binary tree representations. Results of extensive simulation runs carried out to collect performance measures for different allocation strategies are discussed. It is shown that this strategy compares favorably in most situations with other known allocation schemes capable of achieving complete subcube recognition.
    Relation: IEEE transactions on computers 41(4), pp.467-479
    DOI: 10.1109/12.135559
    Appears in Collections:[電機工程學系暨研究所] 期刊論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML76View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


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