This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Efficient Task Allocation Scheme for 2D Mesh Architectures
September 1997 (vol. 8 no. 9)
pp. 934-942

Abstract—Efficient allocation of processors to incoming tasks in parallel computer systems is very important for achieving the desired high performance. It requires recognizing the free available processors with minimum overhead. In this paper, we present an efficient task allocation scheme for 2D mesh architectures. By employing a new approach for searching the mesh, our scheme can find the available submesh without scanning the entire mesh, unlike earlier designs. Comprehensive computer simulation reveals that the average allocation time and waiting delay are much smaller than earlier schemes of comparable performances, irrespective of the size of meshes and distribution of the shape of the incoming tasks.

[1] P. Muzumdar, “Evaluation of On-Chip Static Interconnection Networks,” IEEE Trans. Computers, vol. 36, no. 3, pp. 365-369, Mar. 1987.
[2] G. Randade and S.L. Johnsson, "The Communication Efficiency of Meshes, Boolean Cubes and Cube Connected Cycles for Wafer Scale Integration," Proc. Int'l Conf. Parallel Processing, pp. 477-482, Aug. 1987.
[3] "Paragon XP/S Product Overview," Intel Corporation, 1991.
[4] "A Touchstone DELTA System Description," Intel Corporation, 1991.
[5] R. Alverson et al., "The Tera Computer System," Proc. Int'l Conf. Supercomputing, Assoc. of Computing Machinery, N.Y., 1990, pp. 1-6.
[6] 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.
[7] P.J. Chuang and N.F. Tzeng, "Dynamic Processor Allocation in Hypercube Computers," Proc. 17th Ann. Int'l Symp. Computer Architecture, May 1990.
[8] K. Li and K.-H. Cheng, “A Two-Dimensional Buddy System for Dynamic Resource Allocation in a Partitionable Mesh Connected Systems,” J. Parallel and Distributed Computing, vol. 12, pp. 79-83, 1991.
[9] P.J. Chuang and N.F. Tzeng, “An Efficient Submesh Allocation Strategy for Mesh Computer Systems,” Proc. Int'l Conf. Distributed Computing Systems, pp. 256-263, May 1991.
[10] Y. Zhu, "Efficient Processor Allocation Strategies for Mesh-Connected Parallel Computers," J. Parallel and Distributed Computing, vol. 16, pp. 328-337, Dec. 1992.
[11] J. Ding and L.N. Bhuyan, "An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected Systems," Proc. Int'l Conf. Parallel Processing, pp. II-193-200, Aug. 1993.
[12] D. Das Sharma and D.K. Pradhan, “A Fast and Efficient Strategy for Submesh Allocation in Mesh-Connected Parallel Computers,” Proc. Fifth IEEE Symp. Parallel and Distributed Processing, pp. 682-689, Dec. 1993.
[13] H.Y. Youn, S.M. Yoo, and B. Shirazi, "Task Relocation for Two-Dimensional Meshes," Proc. Int'l Conf. Parallel and Distributed Computing Systems, pp. 230-235, Oct. 1994.
[14] R.E. Kessler and J.L. Schwarzmeier, "CRAY T3D: A New Dimension for Cray Research," Proc. COMPCON, pp. 176-182, Feb. 1993.
[15] Y.K. Chu, I.L. Yen, and D.T. Rover, "Incorporating Job Scheduling for Processor Allocation on Two-Dimensional Mesh-Connected Systems," Proc. Symp. Parallel and Distributed Computing Systems, pp. 124-129. Oct. 1994.
[16] D.D. Sharma and D.K. Pradhan, "Job Scheduling in Mesh Multicomputers," Proc. Int'l Conf. Parallel Processing, pp. II-251-258, Aug. 1994.
[17] D. Babbar and P. Krueger, “A Performance Comparison of Processor Allocation and Job Scheduling Algorithms for Mesh-Connected Multiprocessors,” Proc. Sixth IEEE Symp. Parallel and Distributed Processing, pp. 46-53, Oct. 1994.
[18] K. Hwang, Advanced Computer Architecture: Parallelism, Scalability, Programmability. McGraw-Hill, 1993.

Index Terms:
Complete submesh recognition, coverage submesh, meshes, task allocation, waiting delay.
Citation:
Seong-Moo Yoo, Hee Yong Youn, Behrooz Shirazi, "An Efficient Task Allocation Scheme for 2D Mesh Architectures," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 9, pp. 934-942, Sept. 1997, doi:10.1109/71.615439
Usage of this product signifies your acceptance of the Terms of Use.