English  |  正體中文  |  简体中文  |  Items with full text/Total items : 51931/87076 (60%)
Visitors : 8495404      Online Users : 139
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: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/95960

    Title: Processor Allocation in K-Ary N-Cube Multiprocessors
    Authors: Chuang, Po-Jen;Wu, Chih-Ming
    Contributors: 淡江大學電機工程學系
    Keywords: 處理器配置;多處理器;樹崩潰;Processor Allocation;Multiprocessor;Tree Collapsing
    Date: 1997-12
    Issue Date: 2014-02-13 11:27:04 (UTC+8)
    Publisher: N.Y.: IEEE (Institute of Electrical and Electronic Engineers)
    Abstract: Composed of various topologies, the k-ary n-cube system is desirable for accepting and executing topologically different tasks. In this paper, 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 the other strategies, such as the Free-list strategy on k- ary n-cubes and the Sniffing strategy.
    Relation: 一九九七國際平行架構、演算法暨網路研討會論文集=Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks(I-SPAN'97),頁211-214
    Appears in Collections:[電機工程學系暨研究所] 會議論文

    Files in This Item:

    File Description SizeFormat
    Processor Allocation in K-Ary N-Cube Multiprocessors.pdf418KbAdobe PDF135View/Open
    Processor Allocation in K-Ary N-Cube Multiprocessors_英文摘要.docx摘要22KbMicrosoft Word70View/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