Raed Abdulkareem Hasan, Hadeel W. Abdulwahid, Arwa Sahib Abdalzahra
{"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}
引用次数: 4
Abstract
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.