一种高效的互联网分布式系统服务器最小化算法

Swati Mishra, S. K. Panda
{"title":"一种高效的互联网分布式系统服务器最小化算法","authors":"Swati Mishra, S. K. Panda","doi":"10.4018/IJRSDA.2017100102","DOIUrl":null,"url":null,"abstract":"The increasing use of online services leads to an unequal distribution of the loads among the servers. As a result, the problem is to balance the loads among the servers such that the total number of active servers is minimized. One of the possible solutions is to transfer the loads from the underutilized server to a suitable server and make the underutilized server to sleep mode. In this paper, a server minimization algorithm (SMA) is proposed for the solution of server minimization and the load balancing problem. The proposed algorithm reduces the number of servers by merging the loads of the two least loaded servers. Then it determines the standard deviation of the server loads for load balancing. The proposed SMA is compared with an existing load balancing algorithm using the number of minimized servers, load standard deviation and load factor. The simulation results show the efficacy of the SMA.","PeriodicalId":152357,"journal":{"name":"Int. J. Rough Sets Data Anal.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":"{\"title\":\"An Efficient Server Minimization Algorithm for Internet Distributed Systems\",\"authors\":\"Swati Mishra, S. K. Panda\",\"doi\":\"10.4018/IJRSDA.2017100102\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The increasing use of online services leads to an unequal distribution of the loads among the servers. As a result, the problem is to balance the loads among the servers such that the total number of active servers is minimized. One of the possible solutions is to transfer the loads from the underutilized server to a suitable server and make the underutilized server to sleep mode. In this paper, a server minimization algorithm (SMA) is proposed for the solution of server minimization and the load balancing problem. The proposed algorithm reduces the number of servers by merging the loads of the two least loaded servers. Then it determines the standard deviation of the server loads for load balancing. The proposed SMA is compared with an existing load balancing algorithm using the number of minimized servers, load standard deviation and load factor. The simulation results show the efficacy of the SMA.\",\"PeriodicalId\":152357,\"journal\":{\"name\":\"Int. J. Rough Sets Data Anal.\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"33\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Rough Sets Data Anal.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/IJRSDA.2017100102\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Rough Sets Data Anal.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/IJRSDA.2017100102","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 33

摘要

越来越多地使用在线服务导致服务器之间的负载分布不均匀。因此,问题是平衡服务器之间的负载,使活动服务器的总数最小化。一种可能的解决方案是将负载从未充分利用的服务器转移到合适的服务器,并使未充分利用的服务器进入休眠模式。本文提出了一种服务器最小化算法(SMA)来解决服务器最小化和负载均衡问题。该算法通过合并两个负载最小的服务器的负载来减少服务器的数量。然后确定服务器负载的标准偏差,以实现负载平衡。通过最小化服务器数、负载标准差和负载因子,将该算法与现有的负载均衡算法进行了比较。仿真结果表明了该算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Efficient Server Minimization Algorithm for Internet Distributed Systems
The increasing use of online services leads to an unequal distribution of the loads among the servers. As a result, the problem is to balance the loads among the servers such that the total number of active servers is minimized. One of the possible solutions is to transfer the loads from the underutilized server to a suitable server and make the underutilized server to sleep mode. In this paper, a server minimization algorithm (SMA) is proposed for the solution of server minimization and the load balancing problem. The proposed algorithm reduces the number of servers by merging the loads of the two least loaded servers. Then it determines the standard deviation of the server loads for load balancing. The proposed SMA is compared with an existing load balancing algorithm using the number of minimized servers, load standard deviation and load factor. The simulation results show the efficacy of the SMA.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信