教師資料查詢 | 類別: 期刊論文 | 教師: 莊博任 Chuang Po-jen (瀏覽個人網頁)

標題:A fast recognition-complete processor allocation strategy for hypercube computers
學年80
學期2
出版(發表)日期1992/04/01
作品名稱A fast recognition-complete processor allocation strategy for hypercube computers
作品名稱(其他語言)
著者莊博任=Chuang, Po-jen; Tzeng, Nian-feng
單位淡江大學電機工程學系
出版者
著錄名稱、卷期、頁數IEEE transactions on computers 41(4), pp.467-479
摘要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.
關鍵字Hypercubes;Binary trees;Topology;Prototypes;Rotation measurement;Supercomputers;Costs;Research and development;Reflective binary codes
語言英文(美國)
ISSN0018-9340
期刊性質國外
收錄於
產學合作
通訊作者
審稿制度
國別美國
公開徵稿
出版型式,紙本
相關連結
Google+ 推薦功能,讓全世界都能看到您的推薦!