Subasish Mohapatra, Ishan Aryendu, Anshuman Panda, A. K. Padhi
{"title":"A Modern Approach for Load Balancing Using Forest Optimization Algorithm","authors":"Subasish Mohapatra, Ishan Aryendu, Anshuman Panda, A. K. Padhi","doi":"10.1109/ICCMC.2018.8487765","DOIUrl":null,"url":null,"abstract":"Load Balancing plays a dynamic role in keeping the tempo of the Cloud Computing framework. This research paper proposes a Forest Optimization Algorithm for load balancing in distributed computing structure. This depends on the conduct of the trees in the forest and uses the seed dispersal strategies for streamlining the makespan, which results in improved average response time and the total execution time. The simulation results prove that the proposed algorithm gives better outcomes than its counterpart load balancing algorithms.","PeriodicalId":6604,"journal":{"name":"2018 Second International Conference on Computing Methodologies and Communication (ICCMC)","volume":"1 1","pages":"85-90"},"PeriodicalIF":0.0000,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Second International Conference on Computing Methodologies and Communication (ICCMC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCMC.2018.8487765","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
Load Balancing plays a dynamic role in keeping the tempo of the Cloud Computing framework. This research paper proposes a Forest Optimization Algorithm for load balancing in distributed computing structure. This depends on the conduct of the trees in the forest and uses the seed dispersal strategies for streamlining the makespan, which results in improved average response time and the total execution time. The simulation results prove that the proposed algorithm gives better outcomes than its counterpart load balancing algorithms.