English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 51511/86795 (59%)
造訪人次 : 8280023      線上人數 : 131
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/46285

    題名: Creating disjoint paths for parallel task migration in hypercube computer systems
    作者: 莊博任;Chuang, Po-jen
    貢獻者: 淡江大學電機工程學系
    日期: 1998-01
    上傳時間: 2010-03-26 21:55:23 (UTC+8)
    摘要: In a parallel computer system based on the hypercube topology, a fragmentation problem may occur in which processor resources, even if there are a sufficient number available, do not form a subcube large enough for an incoming task, seriously jeopardizing system utilization. Compaction is one effective solution to such a fragmentation problem, but the task migration overhead involved is quite large. To reduce such overhead, parallel migration is considered. This paper presents a new algorithm able to determine two link-disjoint paths between corresponding nodes for parallel transmission of data during migration. Under this algorithm, for every possible pair of source and destination subcubes, two link-disjoint paths each pair of corresponding nodes can be found for migrating data simultaneously. With each path delivering one half of the total migrated data, the migration overhead can be thus cut down by half. The proposed algorithm is applicable to any systems with any subcube allocation strategies, and even to systems under the circuit-switched mode of operation.
    關聯: International journal of distributed systems and networks 1(1), pp.34-42
    顯示於類別:[電機工程學系暨研究所] 期刊論文





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