A fast recognition-complete processor allocation strategy for hypercube computers

doi:10.1109/12.135559

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

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/60702

題名:	A fast recognition-complete processor allocation strategy for hypercube computers
作者:	莊博任=Chuang, Po-jen;Tzeng, Nian-feng
貢獻者:	淡江大學電機工程學系
關鍵詞:	Hypercubes;Binary trees;Topology;Prototypes;Rotation measurement;Supercomputers;Costs;Research and development;Reflective binary codes
日期:	1992-04
上傳時間:	2011-10-15 00:44:34 (UTC+8)
摘要:	Fully recognizing various subcubes in a hypercube computer efficiently is addressed. A method with much less complexity than the multiple-GC strategy in generating the search space, while achieving complete subcube recognition, is proposed. This method is referred to as a dynamic processor allocation scheme because the search space generated is dependent on the dimension of the requested subcube dynamically. The basic idea lies in collapsing the binary tree representations of a hypercube successively so that the nodes which form a subcube but are distant are brought close to each other for recognition. The strategy can be implemented efficiently by using right rotating operations on the notations of the sets of subcubes corresponding to the nodes at a certain level of binary tree representations. Results of extensive simulation runs carried out to collect performance measures for different allocation strategies are discussed. It is shown that this strategy compares favorably in most situations with other known allocation schemes capable of achieving complete subcube recognition.
關聯:	IEEE transactions on computers 41(4), pp.467-479
DOI:	10.1109/12.135559
顯示於類別:	[電機工程學系暨研究所] 期刊論文

文件中的檔案:

檔案	大小	格式	瀏覽次數
index.html	0Kb	HTML	77	檢視/開啟

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

TAIR相關文章

資料載入中.....