This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers
January 2002 (vol. 51 no. 1)
pp. 46-60

Efficient processor allocation is crucial for obtaining high performance in space-shared parallel computers. A good processor allocation algorithm should find available processors for incoming jobs, if they exist, with minimum overhead. In this paper, we propose such a fast and efficient processor allocation scheme for mesh-connected multicomputers. By using simple coordinate calculation and spatial subtraction, the proposed scheme reduces the search space drastically and, hence, can locate a free submesh very quickly. The algorithm is implemented efficiently using a stack and therefore is called the stack-based allocation (SBA) algorithm. Extensive simulation reveals that our scheme incurs much less allocation overhead than all of the existing allocation algorithms, while delivering competitive performance.

[1] A. Agarwal et al., “The MIT Alewife Machine: Architecture and Performance,” Proc. Int'l Symp. Computer Architecture, pp. 2-13, June 1995.
[2] R. Alverson et al., "The Tera Computer System," Proc. Int'l Conf. Supercomputing, Assoc. of Computing Machinery, N.Y., 1990, pp. 1-6.
[3] 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.
[4] G.H. Barnes et al., “The Illiac IV Computer,” IEEE Trans. Computers, vol. 17, no. 1, pp. 84-87, Jan. 1968.
[5] “Blue Gene Project,” http://www.research.ibm.com/bluegeneindex.html , 2001.
[6] C. Chang and P. Mohapatra, “An Integrated Processor Management Scheme for the Mesh-Connected Multicomputer Systems,” Proc. Int'l Conf. Parallel Processing, pp. 118-121, Aug. 1997.
[7] S. Chodnekar et al., “Towards a Communication Characterization Methodology for Parallel Applications,” Proc. Int'l Symp. High Performance Computer Architecture, pp. 310-319, Feb. 1997.
[8] 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.
[9] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGraw-Hill, 1990.
[10] J. Ding and L.N. Bhuyan, “An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected Systems,” Proc. Int'l Conf. Parallel Processing, vol. II, pp. 193-200, Aug. 1993.
[11] 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.
[12] K.C. Knowlton, “A Fast Storage Allocator,” Comm. ACM, vol. 8, pp. 623-625, Oct. 1965.
[13] P. Krueger, T.H. Lai, and V.A. Radiya, “Job Scheduling Is More Important than Processor Allocation for Hypercube Computers,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 5, pp. 488-497, May 1994.
[14] D. Lenoski et al., “The Stanford DASH Multiprocessor,” Computer, pp. 63-79, Mar. 1992.
[15] K. Li and K.H. Cheng, “A Two Dimensional Buddy System for Dynamic Resource Allocation in a Partitionable Mesh Connected System,” Proc. ACM Computer Science Conf., pp. 22-28, Feb. 1990.
[16] T. Liu, W. Huang, F. Lombardi, and L.N. Bhuyan, “A Submesh Allocation Scheme for Mesh-Connected Multiprocessor Systems,” Proc. Int'l Conf. Parallel Processing, vol. II, pp. 159-163, Aug. 1995.
[17] P. Muzumdar, “Evaluation of On-Chip Static Interconnection Networks,” IEEE Trans. Computers, vol. 36, no. 3, pp. 365-369, Mar. 1987.
[18] “The nCUBE Processor Manual,” nCUBE Corp., 1992.
[19] “Paragon XP/S Product Overview,” Intel Corp., 1991.
[20] G. Randade and S. 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.
[21] R.N. Sahner, K.S. Trivedi, and A. Puliafito, Performance and Reliability Analysis of Computer Systems: An Example-Based Approach Using the Sharpe Software Package. Kluwer Academic, 1995.
[22] 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.
[23] D. Das Sharma and D.K. Pradhan, “Job Scheduling in Mesh Multicomputers,” Proc. Int'l Conf. Parallel Processing, vol. II, pp. 251-258, Aug. 1994.
[24] “A Touchstone DELTA System Description,” Intel Corp., 1991.
[25] K.S. Trivedi, Probability and Statistics with Reliability, Queuing, and Computer Science Applications. Prentice Hall, 1982.
[26] B.S. Yoo, C.R. Das, and C. Yu, “Processor Management Techniques for Mesh-Connected Multiprocessors,” Proc. Int'l Conf. Parallel Processing, vol. II, pp. 105-112, Aug. 1995.
[27] B.S. Yoo and C.R. Das, “Good Processor Management = Fast Allocation + Efficient Scheduling,” Proc. Int'l Conf. Parallel Processing, pp. 280-287, Aug. 1997.
[28] B.S. Yoo and C.R. Das, “A Fast and Efficient Processor Management Scheme fork-Aryn-Cubes,” J. Parallel and Distributed Computing, vol. 55, no. 2, pp. 192-214, Dec. 1998.
[29] 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.
[30] Y. Zhu, “Efficient Processor Allocation Strategies for Mesh-Connected Parallel Computers,” J. Parallel and Distributed Computing, vol. 16, pp. 328-337, Dec. 1992.

Index Terms:
Allocation overhead, complete submesh recognition ability, mesh-connected multicomputers, processor allocation, stack-based allocation algorithm.
Citation:
Byung S. Yoo, Chita R. Das, "A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers," IEEE Transactions on Computers, vol. 51, no. 1, pp. 46-60, Jan. 2002, doi:10.1109/12.980016
Usage of this product signifies your acceptance of the Terms of Use.