Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2016
License: CC BY
Data sources: Datacite
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2016
License: CC BY
Data sources: ZENODO
addClaim

Proposed Algorithm For Load Balancing On Cloud Data Center

Authors: Pranav Bhokardankar*, Harshal Sharma;

Proposed Algorithm For Load Balancing On Cloud Data Center

Abstract

Cloud servers are basically developed for supporting the efficient communication and the computation remotely. Thus a number of different time zone machines are able to find the services of resources and the computation. Thus each and every time these machines are working in order to resolve the end client request. But sometime these machines are loaded more then their capacity and does not perform as desired and some of the available processing units are considered to be free. This results in the performance loss in the computational servers. In order to find the optimum performance there is need to implement some technique for load balancing. Thus in this presented work the key focus is placed on the investigation of load balancing approaches and the algorithm. In order to find the optimum technique of load balancing, various different algorithms are studied. Among them four most promising techniques are selected which are promising for load balancing in previous studies. These techniques are genetic algorithm which provides the optimization technique for finding most appropriate solution among available solutions, ABC (artificial honey bee colony) algorithm which is also an optimization technique in the similar ways, the round robin which is frequently used for process allocation during CPU scheduling and finally the self-organizing map which is an unsupervised class of machine learning. These methods are implemented and compared on the basis of their performance parameters. The implementation of the proposed comparative study is performed on the JAVA technology and using the Cloud Sim simulator. After simulation of the presented comparative study the performance of the SOM algorithm provides the optimum results as compared to the Genetic algorithm, Honey bee colony and RR (round robin) algorithms.

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
    OpenAIRE UsageCounts
    Usage byUsageCounts
    visibility views 6
    download downloads 1
  • 6
    views
    1
    downloads
    Powered byOpenAIRE UsageCounts
Powered by OpenAIRE graph
Found an issue? Give us feedback
visibility
download
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
views
OpenAIRE UsageCountsViews provided by UsageCounts
downloads
OpenAIRE UsageCountsDownloads provided by UsageCounts
0
Average
Average
Average
6
1
Green