An efficient recognition-complete processor allocation strategy for k-ary n-cube multiprocessors

機構典藏 > College of Engineering > Graduate Institute & Department of Electrical Engineering > Journal Article > Item 987654321/46241

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

Title:	An efficient recognition-complete processor allocation strategy for k-ary n-cube multiprocessors
Authors:	莊博任;Chuang, Po-jen;Wu, Chih-ming
Contributors:	淡江大學電機工程學系
Date:	2000-05
Issue Date:	2010-03-26 21:31:46 (UTC+8)
Publisher:	Piscataway: 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. 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
Relation:	IEEE Transactions on Parallel and Distributed Systems 11(5), pp.485-490
DOI:	10.1109/71.852401
Appears in Collections:	[Graduate Institute & Department of Electrical Engineering] Journal Article

Files in This Item:

File	Description	Size	Format
1045-9219_11(5)p485-490.pdf		681Kb	Adobe PDF	823	View/Open