
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Moonsoo Kang, Chansu Yu, Hee Yong Youn, Ben Lee, Myungchul Kim, "Isomorphic Strategy for Processor Allocation in kAry nCube Systems," IEEE Transactions on Computers, vol. 52, no. 5, pp. 645657, May, 2003.  
BibTex  x  
@article{ 10.1109/TC.2003.1197130, author = {Moonsoo Kang and Chansu Yu and Hee Yong Youn and Ben Lee and Myungchul Kim}, title = {Isomorphic Strategy for Processor Allocation in kAry nCube Systems}, journal ={IEEE Transactions on Computers}, volume = {52}, number = {5}, issn = {00189340}, year = {2003}, pages = {645657}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2003.1197130}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Isomorphic Strategy for Processor Allocation in kAry nCube Systems IS  5 SN  00189340 SP645 EP657 EPD  645657 A1  Moonsoo Kang, A1  Chansu Yu, A1  Hee Yong Youn, A1  Ben Lee, A1  Myungchul Kim, PY  2003 KW  kary ncube KW  processor allocation KW  job scheduling KW  partitioning KW  performance evaluation. VL  52 JA  IEEE Transactions on Computers ER   
Abstract—Due to its topological generality and flexibility, the kary ncube architecture has been actively researched for various applications. However, the processor allocation problem has not been adequately addressed for the kary ncube architecture, even though it has been studied extensively for hypercubes and meshes. The earlier kary ncube allocation schemes based on conventional
[1] M.S. Chen and K.G. Shin, “Processor Allocation in an NCube Multiprocessor Using Gray Codes,” IEEE Trans. Computers, vol. 36, no. 12, pp. 13961407, Dec. 1987.
[2] J. Kim, C.R. Das, and W. Lin, “A TopDown Processor Allocation Scheme for Hypercube Computers,” IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 2030, Jan. 1991.
[3] S. Dutt and J.P. Hayes, "Subcube Allocation in Hypercube Computers," IEEE Trans. Computers, vol. 40, no. 3, pp. 341352, Mar. 1991.
[4] P.J. Chuang and N.F. Tzeng,"A Fast RecognitionComplete Processor Allocation Strategy for Hypercube Computers," IEEE Trans. Computers, pp. 467479, 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. 143150, 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. 934942, 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 BestFit Allocation and a Virtual Submesh Allocation for Faulty Meshes,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 2, pp. 175185, Feb. 1998.
[10] W.J. Dally, "Performance Analysis of kary nCube Interconnection Networks," IEEE Trans. Computers, vol. 39, no. 6, pp. 775785, June 1992.
[11] A. Agarwal, "Limits on Interconnection Network Performance," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 4, pp. 398412, Oct. 1991.
[12] P. Ramanathan and S. Chalasani, "Resource Placement with Multiple Adjacency Constraints in kAry nCubes," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 5, pp. 511519, May 1995.
[13] B. Bose, B. Broeg, Y. Kwon, and Y. Ashir, "Lee Distance and Topological Properties of kAry nCubes," IEEE Trans. Computers, vol. 44, no. 8, pp. 1,0211,030, Aug. 1995.
[14] K. Day and A.E. AlAyyoub, “Fault Diameter ofkArynCube Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 9, pp. 903907, Sept. 1997.
[15] D.K. Panda, S. Singal, and R. Kesavan, “Multidestination Message Passing in Wormhole kAry nCube Networks with Base Routing Conformed Paths,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 1, pp. 7696, Jan. 1999.
[16] V. Gautam and V. Chaudhary, “Subcube Allocation Strategies in a KAry NCube,” Proc. Int'l Conf. Parallel and Distributed Computing and Systems, pp. 141146, 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. 216221, 1995.
[18] K. Windisch, V. Lo, and B. Bose, “Contiguous and NonContiguous Processor Allocation Algorithms for kAry nCubes,” 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. 5973, 1997.
[20] P.J. Chuang and C.M. Wu, “An Efficient RecognitionComplete 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. 485490, 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. 104113, 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. 95116, 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. 134, 1997.
[25] M. HBalter 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, “JobBased Queue Delay Modeling in a SpaceShared Hypercube,” Proc. ICPP Workshop Parallel Computing, pp. 313318, 1999.