Comparing static load balancing algorithms in grid

  • Authors:
  • Sherihan Abu Elenin;Masato Kitakami

  • Affiliations:
  • Graduate School of Advanced Integration Science, Chiba University, Inage-ku, Chiba, Japan;Graduate School of Advanced Integration Science, Chiba University, Inage-ku, Chiba, Japan

  • Venue:
  • CDVE'11 Proceedings of the 8th international conference on Cooperative design, visualization, and engineering
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The ability to monitor and manage Grid computing components is critical for enabling high performance distributed computing. The Grid Monitoring Architecture (GMA) specification sets out the requirements and constraints of any implementation. There are many systems that implement GMA but all have some drawbacks such as, difficult to install, single point of failure, or loss of control message. So we design a simple model after we analyze the requirements of Grid monitoring. We propose grid monitoring system based on GMA. The proposed grid monitoring system consists of producers, registry, consumers, and failover registry. The goals of it are the management and failure recovery. Load balancing (LB) should be added to the system to overcome the message overloaded. Load balancing algorithms can be static or dynamic. This paper evaluates the four types of static load balancing algorithms. We evaluate the performance of the system by measuring the response time, and throughput. Central Manager algorithm introduces the smallest response time and the highest throughput. So it is the best static load balancing algorithm.