This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Isomorphic Strategy for Processor Allocation in k-Ary n-Cube Systems
May 2003 (vol. 52 no. 5)
pp. 645-657
Chansu Yu, IEEE
Ben Lee, IEEE Computer Society

Abstract—Due to its topological generality and flexibility, the k-ary n-cube architecture has been actively researched for various applications. However, the processor allocation problem has not been adequately addressed for the k-ary n-cube architecture, even though it has been studied extensively for hypercubes and meshes. The earlier k-ary n-cube allocation schemes based on conventional slice partitioning suffer from internal fragmentation of processors. In contrast, algorithms based on job-based partitioning alleviate the fragmentation problem but require higher time complexity. This paper proposes a new allocation scheme based on isomorphic partitioning, where the processor space is partitioned into higher dimensional isomorphic subcubes. The proposed scheme minimizes the fragmentation problem and is general in the sense that any size request can be supported and the host architecture need not be isomorphic. Extensive simulation study reveals that the proposed scheme significantly outperforms earlier schemes in terms of mean response time for practical size k-ary and n-cube architectures. The simulation results also show that reduction of external fragmentation is more substantial than internal fragmentation with the proposed scheme.

[1] M.S. Chen and K.G. Shin, “Processor Allocation in an N-Cube Multiprocessor Using Gray Codes,” IEEE Trans. Computers, vol. 36, no. 12, pp. 1396-1407, Dec. 1987.
[2] J. Kim, C.R. Das, and W. Lin, “A Top-Down Processor Allocation Scheme for Hypercube Computers,” IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 20-30, Jan. 1991.
[3] S. Dutt and J.P. Hayes, "Subcube Allocation in Hypercube Computers," IEEE Trans. Computers, vol. 40, no. 3, pp. 341-352, Mar. 1991.
[4] P.-J. Chuang and N.-F. Tzeng,"A Fast Recognition-Complete Processor Allocation Strategy for Hypercube Computers," IEEE Trans. Computers, pp. 467-479, Apr. 1992.
[5] C. Yu and C.R. Das, “Limit Allocation: An Efficient Processor Management Scheme for Hypercubes,” Proc. Int'l Conf. Parallel Processing, pp. 143-150, 1994.
[6] C. Chang and P. Mohapatra, “Improving Performance of Mesh Connected Multicomputers by Reducing Fragmentation,” J. Parallel and Distributed Computing, July 1998.
[7] S.M. Yoo and H.Y. Youn, “An Efficient Task Allocation Scheme for 2D Mesh Architectures,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 9, pp. 934-942, Sept. 1997.
[8] D.D. Sharma and D.K. Pradhan, “Job Scheduling in Mesh Multicomputers,” IEEE Trans. Parallel and Distributed Systems, pp. 57–70, Jan. 1998.
[9] G. Kim and H. Yoon, “On Submesh Allocation for Mesh Multicomputers: A Best-Fit Allocation and a Virtual Submesh Allocation for Faulty Meshes,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 2, pp. 175-185, Feb. 1998.
[10] W.J. Dally, "Performance Analysis of k-ary n-Cube Interconnection Networks," IEEE Trans. Computers, vol. 39, no. 6, pp. 775-785, June 1992.
[11] A. Agarwal, "Limits on Interconnection Network Performance," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 4, pp. 398-412, Oct. 1991.
[12] P. Ramanathan and S. Chalasani, "Resource Placement with Multiple Adjacency Constraints in k-Ary n-Cubes," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 5, pp. 511-519, May 1995.
[13] B. Bose, B. Broeg, Y. Kwon, and Y. Ashir, "Lee Distance and Topological Properties of k-Ary n-Cubes," IEEE Trans. Computers, vol. 44, no. 8, pp. 1,021-1,030, Aug. 1995.
[14] K. Day and A.E. Al-Ayyoub, “Fault Diameter ofk-Aryn-Cube Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 9, pp. 903-907, Sept. 1997.
[15] D.K. Panda, S. Singal, and R. Kesavan, “Multidestination Message Passing in Wormhole k-Ary n-Cube Networks with Base Routing Conformed Paths,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 1, pp. 76-96, Jan. 1999.
[16] V. Gautam and V. Chaudhary, “Subcube Allocation Strategies in a K-Ary N-Cube,” Proc. Int'l Conf. Parallel and Distributed Computing and Systems, pp. 141-146, 1993.
[17] G. Dommety, V. Chaudhary, and B. Sabata, “Strategies for Processor Allocation in$\big. k{\hbox{-}}\rm Ary\bigr.$$\big. n{\hbox{-}}\rm Cubes\bigr.$,” Proc. Int'l Conf. Parallel and Distributed Computing and Systems, pp. 216-221, 1995.
[18] K. Windisch, V. Lo, and B. Bose, “Contiguous and Non-Contiguous Processor Allocation Algorithms for k-Ary n-Cubes,” Proc. Int'l Conf. Parallel Processing, 1995.
[19] H.L. Chen and C.T. King, “Efficient Dynamic Processor Allocation for$\big. k{\hbox{-}}\rm Ary\bigr.$$\big. n{\hbox{-}}\rm Cube\bigr.$Massive Parallel Processors,” Computers Math. Applications, pp. 59-73, 1997.
[20] P.J. Chuang and C.M. Wu, “An Efficient Recognition-Complete Processor Allocation Strategy for$\big. k{\hbox{-}}\rm Ary\bigr.$$\big. n{\hbox{-}}\rm Cube\bigr.$Multiprocessors,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 5, pp. 485-490, May 2000.
[21] Mesquite Software, Inc., User's Guide: CSIM18 Simulation Engine (C++ Version), 1998.
[22] S. Majumdar, D.L. Eager, and R.B. Bunt, “Scheduling in Multiprogrammed Parallel Systems,” Proc. ACM SIGMETRICS Conf. Measuring and Modeling of Computer Systems, pp. 104-113, 1988.
[23] J. Jann, P. Pattnaik, H. Franke, F. Wang, J. Skovira, and J. Riordan, “Modeling of Workload in MPPs,” Job Scheduling Strategies for Parallel Processing, pp. 95-116, 1997.
[24] D. Feitelson, L. Rudolph, U. Schwiegelshohn, K. Sevcik, and P. Wong, “Theory and Practice in Parallel Job Scheduling,” Job Scheduling Strategies for Parallel Processing, pp. 1-34, 1997.
[25] M. H-Balter and A. Downey, “Exploiting Process Lifetime Distributions for Dynamic Load Balancing,” Proc. 15th ACM Symp. Operating Systems Principles, 1995.
[26] M. Kang and C. Yu, “Job-Based Queue Delay Modeling in a Space-Shared Hypercube,” Proc. ICPP Workshop Parallel Computing, pp. 313-318, 1999.

Index Terms:
k-ary n-cube, processor allocation, job scheduling, partitioning, performance evaluation.
Citation:
Moonsoo Kang, Chansu Yu, Hee Yong Youn, Ben Lee, Myungchul Kim, "Isomorphic Strategy for Processor Allocation in k-Ary n-Cube Systems," IEEE Transactions on Computers, vol. 52, no. 5, pp. 645-657, May 2003, doi:10.1109/TC.2003.1197130
Usage of this product signifies your acceptance of the Terms of Use.