Abstract
One of the important factors in Grid computing is load balancing conditions on data processing. Also, one of the techniques and tools that we can influence on availability and ability of load balancing is Cluster computing. In this paper, we present some methods which we can divide one large network to some sub network. By this dividing, we can analyze load balancing conditions on data processing better. So, we use K-Means algorithm for clustering the processors for data processing in network and we investigate the conditions of load balancing on this algorithm. Also, we show that by executing this algorithm the speed of data processing becomes high and the process traffic are divided between the entire sub networks normally. By these results, cluster computing techniques such as K-Means algorithm are one of the effective and essential solutions for grid computing problems and load balancing.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
