This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Job Scheduling in Mesh Multicomputers
January 1998 (vol. 9 no. 1)
pp. 57-70

Abstract—A new approach for dynamic job scheduling in mesh-connected multiprocessor systems, which supports a multiuser environment, is proposed in this paper. Our approach combines a submesh reservation policy with a priority-based scheduling policy to obtain high performance in terms of high throughput, high utilization, and low turn-around times for jobs. This high performance is achieved at the expense of scheduling jobs in a strictly fair, FCFS fashion; in fact, the algorithm is parameterized to allow trade-offs between performance and (short-term) FCFS fairness. The proposed scheduler can be used with any submesh allocation policy. A fast and efficient implementation of the proposed scheduler has also been presented. The performance of the proposed scheme has been compared with the FCFS policy, the only existing scheduling strategy for meshes, to demonstrate the effectiveness of the proposed approach. Simulation results indicate that our scheduling strategy outperforms the FCFS policy significantly. Specifically, our strategy significantly reduces the average waiting delay of jobs over the FCFS policy. The fast implementation of the proposed scheduler results in low allocation and deallocation time overhead, as well as low space overhead.

[1] R. Alverson et al., "The Tera Computer System," Proc. Int'l Conf. Supercomputing, Assoc. of Computing Machinery, N.Y., 1990, pp. 1-6.
[2] S. Baase, Computer Algorithms: Introduction to Design and Analysis, second ed. Addison-Wesley, 1991.
[3] T.E. Bell, "Beyond Today's Supercomputers," IEEE Spectrum, pp. 72-75, Sept. 1992.
[4] 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.
[5] Cray Research Inc., MPP Technology Preview. Cray Research Inc., 1992.
[6] D. Das Sharma, "Space and Time Scheduling in Multicomputers," PhD dissertation, Univ. of Massachusetts, Amherst, 1995.
[7] D. Das Sharma and D.K. Pradhan,“A novel approach for subcube allocation inhypercube multiprocessors,” Proc. Fourth IEEE Symp. Parallel andDistributed Systems, pp. 336-345, Dec. 1992.
[8] D. Das Sharma and D.K. Pradhan, "Fast and Efficient Strategies for Cubic and Non-Cubic Allocation in Hypercube Multiprocessors," Proc. Intl. Conf. Parallel Processing, vol. I, pp. 118-127, Jan. 1993.
[9] D.D. Sharma and D.K. Pradhan, “Submesh Allocation in Mesh Multicomputers Using Busy-List: A Best-Fit Approach with Complete Recognition Capability,” J. Parallel and Distributed Computing, vol. 36 pp. 106-118, Aug. 1996.
[10] 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.
[11] D. Das Sharma and D.K. Pradhan, "Job Scheduling in Mesh Multicomputers," Proc. 1994 Int'l Conf. Parallel Processing, vol. II, Aug. 1994.
[12] D. Das Sharma and D.K. Pradhan, "Submesh Allocation in Mesh Multicomputers," Technical Report 93-043, Dept. of Computer Science, Texas A&M Univ., 1993.
[13] D. Das Sharma and D.K. Pradhan, "A Reservation-Based Job Scheduling Scheme for Hypercube Multicomputers," Technical Report 93-003, Dept. of Computer Science, Texas A&M Univ., 1993.
[14] D. Das Sharma and D.K. Pradhan, "Job Scheduling in Mesh Multicomputers," Technical Report 94-005, Dept. of Computer Science, Texas A&M Univ., 1994.
[15] D. Das Sharma, "Processor Allocation in Hypercube Multicomputers: The Random Allocation Strategy," Proc. ISCA Intl. Conf. Parallel and Distributed Computing Systems, pp. 439-445, Sept. 1995.
[16] S. Dutt and J.P. Hayes,“On allocating subcubes in a Hhpercubemultiprocessor,” Proc. Third Conf. Hypercube Computers and Applications, pp. 801-810, Jan. 1988.
[17] J. Ding and L.N. Bhuyan, "An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected Systems," Proc. 1993 Int'l Conf. Parallel Processing, 1993.
[18] Intel Corp., A Touchstone DELTA System Description. Intel Corp., 1991.
[19] Intel Corp., Paragon XP/S Product Overview. Intel Corp., 1991.
[20] D.K. Kahaner and U. Wattenberg, "Japan: A Competitive Assessment," IEEE Spectrum, pp. 42-47, Sept. 1992.
[21] 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.
[22] K.C. Knowlton, “A Fast Storage Allocator,” Comm. ACM, vol. 8, pp. 623-625, Oct. 1965.
[23] P. Krueger,T.-H. Lai,, and V.A. Radiya,“Processor allocation vs. job scheduling on hypercube computers,” Proc. 11th Int’l Conf. Distributed Computing Systems,Arlington, Tex., pp. 394-401, 1991.
[24] 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.
[25] 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.
[26] K. Li and K.H. Cheng, "Job Scheduling in Partitionable Mesh Connected Systems," Proc. 1989 Int'l Conf. Parallel Processing, vol. 2, pp. 65-72, 1989.
[27] 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.
[28] P. Mohapatra, C. Yu, C.R. Das, and J. Kim, "A Lazy Scheduling Scheme for Improving Hypercube Performance," Proc. 1993 Int'l Conf. Parallel Processing, vol. I, pp. 110-117, Jan. 1993.
[29] A. S. Tanenbaum,Operating Systems: Design and Implementation. Englewood Cliffs, NJ: Prentice-Hall, 1987.
[30] C. Yu, P. Mohapatra, and C.R. Das, "Processor Allocation Using a Reservation Technique in Hypercube Computers," Proc. ISCA Int'l Conf. Parallel and Distributed Computing and Systems, pp. 147-152, 1993.
[31] Y. Zhu, "Efficient Processor Allocation Strategies for Mesh-Connected Parallel Computers," J. Parallel and Distributed Computing, vol. 16, pp. 328-337, Dec. 1992.
[32] G. Zorpette, "The Power of Parallelism," IEEE Spectrum, pp. 28-33, Sept. 1992.

Index Terms:
Allocation, deallocation, mesh, reservation, priority, scheduling.
Citation:
Debendra Das Sharma, Dhiraj K. Pradhan, "Job Scheduling in Mesh Multicomputers," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 1, pp. 57-70, Jan. 1998, doi:10.1109/71.655244
Usage of this product signifies your acceptance of the Terms of Use.