Creating disjoint paths for parallel task migration in hypercube computer systems

淡江大學機構典藏 > 工學院 > 電機工程學系暨研究所 > 期刊論文 > Item 987654321/46285

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/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
显示于类别:	[電機工程學系暨研究所] 期刊論文

文件中的档案:

没有与此文件相关的档案.

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

TAIR相关文章