
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Byung S. Yoo, Chita R. Das, "A Fast and Efficient Processor Allocation Scheme for MeshConnected Multicomputers," IEEE Transactions on Computers, vol. 51, no. 1, pp. 4660, January, 2002.  
BibTex  x  
@article{ 10.1109/12.980016, author = {Byung S. Yoo and Chita R. Das}, title = {A Fast and Efficient Processor Allocation Scheme for MeshConnected Multicomputers}, journal ={IEEE Transactions on Computers}, volume = {51}, number = {1}, issn = {00189340}, year = {2002}, pages = {4660}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.980016}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Fast and Efficient Processor Allocation Scheme for MeshConnected Multicomputers IS  1 SN  00189340 SP46 EP60 EPD  4660 A1  Byung S. Yoo, A1  Chita R. Das, PY  2002 KW  Allocation overhead KW  complete submesh recognition ability KW  meshconnected multicomputers KW  processor allocation KW  stackbased allocation algorithm. VL  51 JA  IEEE Transactions on Computers ER   
Efficient processor allocation is crucial for obtaining high performance in spaceshared 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 meshconnected 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 stackbased 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. 213, June 1995.
[2] R. Alverson et al., "The Tera Computer System," Proc. Int'l Conf. Supercomputing, Assoc. of Computing Machinery, N.Y., 1990, pp. 16.
[3] D. Babbar and P. Krueger, “A Performance Comparison of Processor Allocation and Job Scheduling Algorithms for MeshConnected Multiprocessors,” Proc. Sixth IEEE Symp. Parallel and Distributed Processing, pp. 4653, Oct. 1994.
[4] G.H. Barnes et al., “The Illiac IV Computer,” IEEE Trans. Computers, vol. 17, no. 1, pp. 8487, 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 MeshConnected Multicomputer Systems,” Proc. Int'l Conf. Parallel Processing, pp. 118121, Aug. 1997.
[7] S. Chodnekar et al., “Towards a Communication Characterization Methodology for Parallel Applications,” Proc. Int'l Symp. High Performance Computer Architecture, pp. 310319, 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. 256263, May 1991.
[9] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGrawHill, 1990.
[10] J. Ding and L.N. Bhuyan, “An Adaptive Submesh Allocation Strategy for TwoDimensional Mesh Connected Systems,” Proc. Int'l Conf. Parallel Processing, vol. II, pp. 193200, Aug. 1993.
[11] 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.
[12] K.C. Knowlton, “A Fast Storage Allocator,” Comm. ACM, vol. 8, pp. 623625, 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. 488497, May 1994.
[14] D. Lenoski et al., “The Stanford DASH Multiprocessor,” Computer, pp. 6379, 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. 2228, Feb. 1990.
[16] T. Liu, W. Huang, F. Lombardi, and L.N. Bhuyan, “A Submesh Allocation Scheme for MeshConnected Multiprocessor Systems,” Proc. Int'l Conf. Parallel Processing, vol. II, pp. 159163, Aug. 1995.
[17] P. Muzumdar, “Evaluation of OnChip Static Interconnection Networks,” IEEE Trans. Computers, vol. 36, no. 3, pp. 365369, 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. 477482, Aug. 1987.
[21] R.N. Sahner, K.S. Trivedi, and A. Puliafito, Performance and Reliability Analysis of Computer Systems: An ExampleBased 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 MeshConnected Parallel Computers,” Proc. Fifth IEEE Symp. Parallel and Distributed Processing, pp. 682689, Dec. 1993.
[23] D. Das Sharma and D.K. Pradhan, “Job Scheduling in Mesh Multicomputers,” Proc. Int'l Conf. Parallel Processing, vol. II, pp. 251258, 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 MeshConnected Multiprocessors,” Proc. Int'l Conf. Parallel Processing, vol. II, pp. 105112, Aug. 1995.
[27] B.S. Yoo and C.R. Das, “Good Processor Management = Fast Allocation + Efficient Scheduling,” Proc. Int'l Conf. Parallel Processing, pp. 280287, Aug. 1997.
[28] B.S. Yoo and C.R. Das, “A Fast and Efficient Processor Management Scheme forkArynCubes,” J. Parallel and Distributed Computing, vol. 55, no. 2, pp. 192214, 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. 934942, Sept. 1997.
[30] Y. Zhu, “Efficient Processor Allocation Strategies for MeshConnected Parallel Computers,” J. Parallel and Distributed Computing, vol. 16, pp. 328337, Dec. 1992.