English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 51275/86342 (59%)
造訪人次 : 8147011      線上人數 : 57
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/95960


    題名: Processor Allocation in K-Ary N-Cube Multiprocessors
    作者: Chuang, Po-Jen;Wu, Chih-Ming
    貢獻者: 淡江大學電機工程學系
    關鍵詞: 處理器配置;多處理器;樹崩潰;Processor Allocation;Multiprocessor;Tree Collapsing
    日期: 1997-12
    上傳時間: 2014-02-13 11:27:04 (UTC+8)
    出版者: N.Y.: IEEE (Institute of Electrical and Electronic Engineers)
    摘要: 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.
    關聯: 一九九七國際平行架構、演算法暨網路研討會論文集=Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks(I-SPAN'97),頁211-214
    顯示於類別:[電機工程學系暨研究所] 會議論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    Processor Allocation in K-Ary N-Cube Multiprocessors.pdf418KbAdobe PDF124檢視/開啟
    Processor Allocation in K-Ary N-Cube Multiprocessors_英文摘要.docx摘要22KbMicrosoft Word70檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

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