利用理想时间范围确定能源成本

Raed Abdulkareem Hasan, Hadeel W. Abdulwahid, Arwa Sahib Abdalzahra
{"title":"利用理想时间范围确定能源成本","authors":"Raed Abdulkareem Hasan, Hadeel W. Abdulwahid, Arwa Sahib Abdalzahra","doi":"10.52866/ijcsm.2021.02.01.002","DOIUrl":null,"url":null,"abstract":"In most optimal VM placement algorithms, the first step to determine the proper time horizon, T\nfor the prediction of the expected maximum future load, L. However, T is dependent on the proper knowledge of the\nrequired time for servers to switch from their initial SLEEP/ACTIVE state to the next desired state. The activities\nimplemented by this policy are (a) to relocate the VM from an encumbered server, a server that operates in an\nundesirably high regime with applications forecasted to rise their burdens to compute in the subsequent reallocation\ncycles; (b) to conduct VM migration from servers that operate within the undesirable regime to shift the server to\na SLEEP mode; (c) putting an idle server to SLEEP mode and rebooting the servers from the SLEEP mode at high\ncluster loads. A novel mechanism for forwarding arriving client desires to the utmost suitable server is implemented;\nthus, in the complete system, balancing the requested load is possible.","PeriodicalId":158721,"journal":{"name":"Iraqi Journal for Computer Science and Mathematics","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Using Ideal Time Horizon for Energy Cost Determination\",\"authors\":\"Raed Abdulkareem Hasan, Hadeel W. Abdulwahid, Arwa Sahib Abdalzahra\",\"doi\":\"10.52866/ijcsm.2021.02.01.002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In most optimal VM placement algorithms, the first step to determine the proper time horizon, T\\nfor the prediction of the expected maximum future load, L. However, T is dependent on the proper knowledge of the\\nrequired time for servers to switch from their initial SLEEP/ACTIVE state to the next desired state. The activities\\nimplemented by this policy are (a) to relocate the VM from an encumbered server, a server that operates in an\\nundesirably high regime with applications forecasted to rise their burdens to compute in the subsequent reallocation\\ncycles; (b) to conduct VM migration from servers that operate within the undesirable regime to shift the server to\\na SLEEP mode; (c) putting an idle server to SLEEP mode and rebooting the servers from the SLEEP mode at high\\ncluster loads. A novel mechanism for forwarding arriving client desires to the utmost suitable server is implemented;\\nthus, in the complete system, balancing the requested load is possible.\",\"PeriodicalId\":158721,\"journal\":{\"name\":\"Iraqi Journal for Computer Science and Mathematics\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Iraqi Journal for Computer Science and Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.52866/ijcsm.2021.02.01.002\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Iraqi Journal for Computer Science and Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.52866/ijcsm.2021.02.01.002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

在大多数最佳VM放置算法中,第一步是确定适当的时间范围,T用于预测预期的最大未来负载,l。然而,T依赖于服务器从初始SLEEP/ACTIVE状态切换到下一个所需状态所需时间的适当知识。此策略实现的活动是(a)从一个受阻碍的服务器中重新定位VM,该服务器在不受欢迎的高状态下运行,预计应用程序将在随后的重新分配周期中增加其计算负担;(b)将运作在不理想模式下的伺服器的虚拟机迁移至SLEEP模式;(c)将空闲服务器置于SLEEP模式,并在高集群负载时从SLEEP模式重新启动服务器。实现了一种将到达的客户机请求转发到最合适的服务器的新机制;因此,在整个系统中,平衡请求的负载是可能的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Using Ideal Time Horizon for Energy Cost Determination
In most optimal VM placement algorithms, the first step to determine the proper time horizon, T for the prediction of the expected maximum future load, L. However, T is dependent on the proper knowledge of the required time for servers to switch from their initial SLEEP/ACTIVE state to the next desired state. The activities implemented by this policy are (a) to relocate the VM from an encumbered server, a server that operates in an undesirably high regime with applications forecasted to rise their burdens to compute in the subsequent reallocation cycles; (b) to conduct VM migration from servers that operate within the undesirable regime to shift the server to a SLEEP mode; (c) putting an idle server to SLEEP mode and rebooting the servers from the SLEEP mode at high cluster loads. A novel mechanism for forwarding arriving client desires to the utmost suitable server is implemented; thus, in the complete system, balancing the requested load is possible.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
4.30
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信