English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 56167/90161 (62%)
造访人次 : 11560361      在线人数 : 106
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻

    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/60702

    题名: A fast recognition-complete processor allocation strategy for hypercube computers
    作者: 莊博任=Chuang, Po-jen;Tzeng, Nian-feng
    贡献者: 淡江大學電機工程學系
    关键词: Hypercubes;Binary trees;Topology;Prototypes;Rotation measurement;Supercomputers;Costs;Research and development;Reflective binary codes
    日期: 1992-04
    上传时间: 2011-10-15 00:44:34 (UTC+8)
    摘要: 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.
    關聯: IEEE transactions on computers 41(4), pp.467-479
    DOI: 10.1109/12.135559
    显示于类别:[電機工程學系暨研究所] 期刊論文


    档案 大小格式浏览次数



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