Towards Decentralized Load Balancing in a Computational Grid Environment
Load balancing has been a key concern for locally distributed multiprocessor systems. The emergence of computational grid extends this problem, such as scalability, heterogeneity of computing resources and considerable communication delay. In this paper, we study the problem of scheduling a large number of CPU-intensive jobs on such systems. The time spent by a job in the system is considered as the main issue that needs to be minimized. The proposed dynamic algorithm of scheduling jobs consists of two policies: Instantaneous Distribution Policy (IDP) and Load Adjustment Policy (LAP). Our algorithm does not address directly the load balancing problem since it is completely unrealistic in such large environments, but we will show that even a non-perfectly load balanced system can behave reasonably well by taking into account the jobs’ time demands. The proposed algorithm is evaluated by a series of simulations.
KeywordsLoad Balance Transmission Delay Computing Node Average Response Time Communication Delay
Unable to display preview. Download preview PDF.
- 1.Foster, I., Kesselman, C. (eds.): The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco (1999)Google Scholar
- 7.Shivaratri, N.G., Krueger, P., Singhal, M.: Load distributing for locally distributed systems. Computer, 33–44 (1992)Google Scholar
- 9.Sanders, P.: Analysis of nearest neighbor load balancing algorithms for random loads. Parallel Computing 25(80) (1999)Google Scholar
- 14.Agrawal, A., Casanova, H.: Clustering hosts in P2P and global computing platforms. In: 3rd IEEE/ACM International Symposium on CCGrid 2003, 12-15 May 2003, pp. 367–373 (2003)Google Scholar
- 15.Theilmann, W., Rothermel, K.: Dynamic distance maps of the Internet. INFOCOM 2000. In: Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings, March 26-30, vol. 1, pp. 275–284. IEEE, Los Alamitos (2000)Google Scholar
- 16.Xian-He, S., Ming, W.: GHS: A performance prediction and task scheduling system for Grid computing. In: IEEE International Parallel and Distributed Processing Symposium, IPDPS 2003 (2003)Google Scholar
- 19.Harchol-Balter, M., Downey, A.: Exploiting Process Lifetime Distributions for Dynamic Load Balancing. In: Proceedings of ACM sigmetrics 1998 Conference on Measurement and Modeling of Computer Systems, May 1997, pp. 115–126 (1997)Google Scholar
- 20.Eager, D.L., Lazowska, E.D., Zahorjan, J.: The limited performance benefits of migrating active processes for load sharing. In: Proceedings of the 12th ACM Symposium on Operating Systems Principles, pp. 63–72 (1988)Google Scholar