This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Processor Allocation in the Mesh Multiprocessors Using the Leapfrog Method
March 2003 (vol. 14 no. 3)
pp. 276-289
Li-Ping Chou, IEEE Computer Society

Abstract—The mesh-connected multiprocessor has become popular for its simple and regular structure. In this paper, a new data structure, the R{\hbox{-}}{\rm{array}} , is proposed to represent the mesh at first. The element in the R{\hbox{-}}{\rm{array}} stores the statistical information about the occupied conditions of the mesh. The statistical information of the R{\hbox{-}}{\rm{array}} can direct the allocation process to jump to the processors that can serve as a base of a free submesh. Based on a simple and reasonable assumption, we develop a stochastic process to analyze the behaviors of the proposed scheme. The proposed scheme is the first one whose probabilities of locating free submeshes under different workloads are precisely computed. These results can be applied to each full-recognition scheme. In addition, the execution costs of the proposed scheme can also be accurately calculated. Finally, the simulations are performed. Compared with a lot of the previous schemes, the simulations show that the proposed schemes are faster than most of them.

[1] R. Hockney and C. Jesshope, Parallel Computers: Architecture, Programming and Algorithms. Adam Hilger, 1981.
[2] G. Barnes et al. “The Illiac IV Computers,” IEEE Trans. Computers, vol. 17, no. 8, pp. 746-757, Aug. 1968.
[3] R. Alverson et al., "The Tera Computer System," Proc. Int'l Conf. Supercomputing, Assoc. of Computing Machinery, N.Y., 1990, pp. 1-6.
[4] D. Lenoski et al., “The Stanford DASH Multiprocessor,” Computer, pp. 63-79, Mar. 1992.
[5] Intel Corp., A Touchstone DELTA System Description. 1991.
[6] Intel Corp., Paragon Network Queuing System Manual. 1993.
[7] M.D. Noakes, D.A. Wallach, and W.J. Dally, "The J-Machine Multicomputer: An Architectural Evaluation," Proc. 20th Ann. Int'l Symp. Computer Architecture, pp. 224-235, May 1993.
[8] R.E. Kessler and J.L. Schwarzmeier, "CRAY T3D: A New Dimension for Cray Research," Proc. COMPCON, pp. 176-182, Feb. 1993.
[9] 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.
[10] P.-J. Chuang and N.-F. Tzeng, “Allocating Precise Submeshes in Mesh Connected Systems,” IEEE Trans. Computers, vol. 5, no. 2, pp. 211-217, Feb. 1994.
[11] J. Ding and L.N. Bhuyan, “An Adaptive Submesh Allocation for Two-Dimensional Mesh Connected Systems,” Proc. 1993 Int'l Conf. Parallel Processing, vol. 2, pp. 193-200, 1993.
[12] Y. Zhu, “Efficient Processor Allocation Strategies for Mesh-Connected Parallel Computers,” J. Parallel and Distributed Computing, vol. 16, pp. 328-377, Dec. 1992.
[13] Y. Zhu, “Fast Processor Allocation and Dynamic Scheduling for Mesh Multiprocessors,” J. Computer Systems Science and Eng., vol. 11, pp. 99-107, May 1996.
[14] G.M. Chiu and S.K. Chen, “An Efficient Submesh Allocation Scheme for Two-Dimensional Meshes with Little Overhead,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 3, pp. 471-486, May 1999.
[15] V. Gupta and A. Jayendran, “A Flexible Processor Allocation Strategy for Mesh Connected Parallel System,” Proc. 1996 Int'l Conf. Parallel Processing, vol. 3, pp. 166-173, 1996.
[16] W. Liu, V. Lo, K. Windisch, and B. Nitzberg, "Non-Contiguous Processor Allocation Algorithm for Distributed Memory Multicomputers," Proc. Supercomputing '94, pp. 227-236,Washington D. C., 1994.
[17] E. Smirni, C. Childers, E. Rosti, and L. Dowdy, “Thread Placement on the Intel Paragon: Modeling and Experimentation,” Proc. Third Int'l Workshop Modeling, Analysis, and Simulation of Computer and Telecomm. Systems, pp. 226-231, 1995.
[18] S. Chittor and R. Enbody, “Performance Degradation in Large Wormhole-Routed Interprocessor Communication Networks,” Proc. 1990 Int'l Conf. Parallel Processing, vol. 1, pp. 424-428, 1990.
[19] L. Kleinrock, Queuing System Vol. 1: Theory. Wiley-Interscience, 1975.

Index Terms:
Allocation, mesh, first-fit, best-fit, buddy, Markov chain, random walk.
Citation:
Fan Wu, Ching-Chi Hsu, Li-Ping Chou, "Processor Allocation in the Mesh Multiprocessors Using the Leapfrog Method," IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 3, pp. 276-289, March 2003, doi:10.1109/TPDS.2003.1189585
Usage of this product signifies your acceptance of the Terms of Use.