Processor allocation in k-ary n-cube multiprocessors

淡江大學機構典藏 > 工學院 > 電機工程學系暨研究所 > 會議論文 > Item 987654321/38760

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

題名:	Processor allocation in k-ary n-cube multiprocessors
作者:	Chuang, Po-jen;Wu, Chih-ming
貢獻者:	淡江大學電機工程學系
關鍵詞:	處理器配置;多處理器;樹崩潰;Processor Allocation;Multiprocessor;Tree Collapsing
日期:	1997
上傳時間:	2010-01-11 15:52:02 (UTC+8)
出版者:	New York: Institute of Electrical and Electronics Engineers (IEEE)
摘要:	Composed of various topologies, the k-ary n-cube system is desirable for accepting and executing topologically different tasks. We propose a new allocation strategy to utilize the large amount of processor resources in the k-ary n-cubes. Our strategy is an extension of the TC strategy on hypercubes and is able to recognize all subcubes with different topologies. Simulation results show that with such full subcube recognition ability and no internal fragmentation, our strategy depicts constantly better performance than other strategies, such as the Free list strategy on k-ary n-cubes and the Sniffing strategy
關聯:	Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks(I-SPAN'97)=一九九七國際平行架構、演算法暨網路研討會論文集, pp.211-214
DOI:	10.1109/ISPAN.1997.645096
顯示於類別:	[電機工程學系暨研究所] 會議論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	245	檢視/開啟
Processor Allocation in k-ary n-cube Multiprocessors.pdf		418Kb	Adobe PDF	327	檢視/開啟

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

TAIR相關文章