Processor allocation in k-ary n-cube multiprocessors

機構典藏 > College of Engineering > Graduate Institute & Department of Electrical Engineering > Proceeding > Item 987654321/38760

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/38760

Title:	Processor allocation in k-ary n-cube multiprocessors
Authors:	Chuang, Po-jen;Wu, Chih-ming
Contributors:	淡江大學電機工程學系
Keywords:	處理器配置;多處理器;樹崩潰;Processor Allocation;Multiprocessor;Tree Collapsing
Date:	1997
Issue Date:	2010-01-11 15:52:02 (UTC+8)
Publisher:	New York: Institute of Electrical and Electronics Engineers (IEEE)
Abstract:	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
Relation:	Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks(I-SPAN'97)=一九九七國際平行架構、演算法暨網路研討會論文集, pp.211-214
DOI:	10.1109/ISPAN.1997.645096
Appears in Collections:	[Graduate Institute & Department of Electrical Engineering] Proceeding

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	245	View/Open
Processor Allocation in k-ary n-cube Multiprocessors.pdf		418Kb	Adobe PDF	326	View/Open