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


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


    题名: Processor allocation in k-ary n-cube multiprocessors
    作者: Chuang, Po-jen;Wu, Chih-ming
    贡献者: 淡江大學電機工程學系
    关键词: 處理器配置;多處理器;樹崩潰;Processor Allocation;Multiprocessor;Tree Collapsing
    日期: 1997
    上传时间: 2010-01-11 15:52:02 (UTC+8)
    出版者: New York: Institute of Electrical and Electronics Engineers (IEEE)
    摘要: Composed of various topologies, the k-ary n-cube system is desirable for accepting and executing topologically different tasks. We propose a new allocation strategy to utilize the large amount of processor resources in the k-ary n-cubes. Our strategy is an extension of the TC strategy on hypercubes and is able to recognize all subcubes with different topologies. Simulation results show that with such full subcube recognition ability and no internal fragmentation, our strategy depicts constantly better performance than other strategies, such as the Free list strategy on k-ary n-cubes and the Sniffing strategy
    關聯: Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks(I-SPAN'97)=一九九七國際平行架構、演算法暨網路研討會論文集, pp.211-214
    DOI: 10.1109/ISPAN.1997.645096
    显示于类别:[電機工程學系暨研究所] 會議論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML224检视/开启
    Processor Allocation in k-ary n-cube Multiprocessors.pdf418KbAdobe PDF304检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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