High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

Load Balancing In Distributed Network by Simulated Annealing Method


Muhammed Usman Khan , Dept of CSE Integral University, Lucknow; Afsaruddin, Dept of CSE Integral University, Lucknow; Riyazuddin khan, Dept of CSE Integral University, Lucknow; Mohd Atif Kaleem, Dept of CSE Integral University, Lucknow


Annealing Method, Load Balancing


Grid computing is a type of distributed computing that involves synchronizing and sharing computing, application, knowledge storage or network resources across dynamic and geologically extended organizations. The goal of grid task programming is to realize high system throughput and to match the applying desire with the available computing resources. This is often matching of resources in very non-deterministically shared heterogeneous environment. The complexness of programming downside will amplify with the dimensions of the grid and becomes extremely troublesome to resolve effectively. To get smart ways to resolve this downside a brand new space of analysis is enforced. This paper is predicated on developed heuristic techniques that are based on simulated annealing or close to best possible solution for grids. During this paper, we have a tendency to introduce a task programming algorithmic rule for grid computing. The algorithmic rule is predicated on simulated tempering methodology. The paper shows the way to seek for the most effective tasks programming for grid computing. During the previous few decades, load balancing in distributed computer system has been a rising analysis space. To seek out associate optimum programming incorporating load balancing for a particular application capital punishment in a very dynamic, unpredictable atmosphere may be a difficult problem. It’s as a result of the advanced nature of the tasks that changes during execution, and unpredictability of the procedure environment. This paper addresses the on top of above mentioned problems by presenting a simulated tempering (SA) approach an associate optimizer. The projected algorithmic program is evaluated in terms of create setting up and resource utilization.

Other Details

Paper ID: IJSRDV3I70316
Published in: Volume : 3, Issue : 7
Publication Date: 01/10/2015
Page(s): 551-553

Article Preview

Download Article