This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Efficient Recognition-Complete Processor Allocation Strategy for k-ary n-cube Multiprocessors
May 2000 (vol. 11 no. 5)
pp. 485-490

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.

[1] W.J. Dally, "Performance Analysis of k-ary n-Cube Interconnection Networks," IEEE Trans. Computers, vol. 39, no. 6, pp. 775-785, June 1992.
[2] K. Hwang, Advanced Computer Architecture: Parallelism, Scalability, Programmability. McGraw-Hill, 1993.
[3] H.-L. Chen and C.-T. King, “An Efficient Dynamic Processor Allocation Scheme forK-aryn-cube Multicomputers,” Proc. 1993 Int'l Conf. Parallel and Distributed Systems, pp. 217–221, Dec. 1993.
[4] V. Gautam and V. Chaudhary, “Subcube Allocation Strategies in aK-aryn-cube,” Proc. 1993 ISCA Int'l Conf. Parallel and Distributed Computing Systems, pp. 141–146, Oct. 1993.
[5] K. Windisch, V. Lo, and B. Bose, “Contiguous and Non-Contiguous Processor Allocation Algorithms forK-aryn-cubes,” Proc. 1995 Int'l Conf. Parallel Processing, pp. II 164–168, Aug. 1995.
[6] N.J. Dimopoulos and V.V. Dimakopoulos, “Optimal and Suboptimal Processor Allocation for Hypercycle-based Multiprocessors,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 2, pp. 175–185, Feb. 1995.
[7] K. Windisch, J.V. Miller, and V. Lo, “ProcSimity: An Experimental Tool for Processor Allocation and Scheduling in Highly Parallel Systems,” Proc. Fifth Symp. the Frontiers of Massively Parallel Computation, pp. 414–421, Feb. 1995.
[8] P.-J. Chuang, “Processor Resource Management in Partitionable Parallel Computers,” PhD. Dissertation, Univ. of Southwestern Louisiana, 1992.

Index Terms:
Full subcube recognition, internal and external fragmentation, k-ary n-cube multiprocessors, performance evaluation, processor allocation, time complexity.
Citation:
Po-Jen Chuang, Chih-Ming Wu, "An Efficient Recognition-Complete Processor Allocation Strategy for k-ary n-cube Multiprocessors," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 5, pp. 485-490, May 2000, doi:10.1109/71.852401
Usage of this product signifies your acceptance of the Terms of Use.