Creating disjoint paths for parallel task migration in hypercube computer systems
學年 86
學期 1
出版（發表）日期 1998-01-01
作品名稱 Creating disjoint paths for parallel task migration in hypercube computer systems
作品名稱（其他語言）
著者 莊博任; Chuang, Po-jen
單位 淡江大學電機工程學系
出版者
著錄名稱、卷期、頁數 International journal of distributed systems and networks 1(1), pp.34-42
摘要 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.
關鍵字
語言 en_US
ISSN
期刊性質 國內
收錄於
產學合作
通訊作者
審稿制度 否
國別 TWN
公開徵稿
出版型式 ,紙本
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/46285 )

機構典藏連結
SDGS 優質教育,產業創新與基礎設施