Load balancing is the process of improving the performance of a parallel and distributed system through a redistribution of load among the processors [1] [5]. In this paper we present the performance analysis of various load balancing algorithms based on different parameters, considering two typical load balancing approaches static and dynamic. The analysis indicates that static and dynamic bot...

in this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. scheduling algorithms play an important role in grid computing, parallel tasks scheduling and sending them to appr...

The parallelization of distinct element models is discussed with particular attention being paid to the problem of load balancing. One method for solving the load balancing problem through the use of a local, dynamic procedure is given and an implementation on the Cray-T3D and the Intel Paragon is described. The theoretical issues surrounding the load balancing problems are shown to map easily ...

We propose a completely general, informed randomized dynamic load balancing method called random seeking (RS) suitable for parallel algorithms with characteristics found in many search algorithms used in artificial intelligence and operations research and many divide-and-conquer algorithms. In it, source processors randomly seek out sink processors for load balancing by flinging “probe” message...

In this paper we present a game theoretic framework for obtaining a user-optimal load balancing scheme in heterogeneous distributed systems. We formulate the static load balancing problem in heterogeneous distributed systems as a noncooperative game among users. For the proposed noncooperative load balancing game, we present the structure of the Nash equilibrium. Based on this structure we deri...

Abstract—Scheduling of jobs in web cluster of servers is a major research activity in Distributed Computing System (DCS). A key issue in server load balancing in a DCS is to select an effective load balancing scheme to distribute clients’ requests to the servers. This paper considers weighted round robin, shortest queue and diffusive load balancing policies. Performance of each of these policie...

Cloud Computing is an attracting technology in the field of computer science. Cloud Computing involves sharing of resources. In the event of processing many jobs, the load balancing becomes essential for efficient operation and to improve user satisfaction. This paper introduces the strategic model that performs load balancing as well as dynamic partition of the nodes of different cloud. Differ...

Since Paxson’s study over ten years ago, the Internet has changed considerably. In particular, routers often perform load balancing. Disambiguating routing changes from load balancing using traceroute-like probing requires a large number of probes. Our first contribution is FastMapping, a probing method that exploits load balancing characteristics to reduce the number of probes needed to measur...