An efficient recognition-complete processor allocation strategy for k-ary n-cube multiprocessors
學年 88
學期 2
出版（發表）日期 2000-05-01
作品名稱 An efficient recognition-complete processor allocation strategy for k-ary n-cube multiprocessors
作品名稱（其他語言）
著者 莊博任; Chuang, Po-jen; Wu, Chih-ming
單位 淡江大學電機工程學系
出版者 Piscataway: Institute of Electrical and Electronics Engineers (IEEE)
著錄名稱、卷期、頁數 IEEE Transactions on Parallel and Distributed Systems 11(5), pp.485-490
摘要 Composed of various topologies, the k-ary n-cube system is desirable for accepting and executing topologically different tasks. To utilize its large amount of processor resources, several allocation strategies have been reported, each with certain restrictions that affect performance. For improvement, we propose a new allocation strategy for the k-ary n-cubes. The proposed strategy is an extension of the TC strategy for hypercubes and is able to recognize all subcubes with different topologies requested by tasks. Complexity analysis and performance comparison between related strategies are provided to demonstrate their advantages and disadvantages. Simulation results show that with full subcube recognition ability and no internal fragmentation, our strategy always exhibits better performance
關鍵字
語言 en
ISSN 1045-9219
期刊性質 國外
收錄於
產學合作
通訊作者
審稿制度
國別 USA
公開徵稿
出版型式 電子版
相關連結

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

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