Open AccessUsing Ideal Time Horizon for Energy Cost Determination
Author(s) -
Raed Abdulkareem Hasan,
Hadeel W. Abdulwahid,
Arwa Sahib Abdalzahra
Publication year - 2021
Publication title -
iraqi journal for computer science and mathematics
Language(s) - English
Resource type - Journals
eISSN - 2958-0544
pISSN - 2788-7421
DOI - 10.52866/ijcsm.2021.02.01.002
Subject(s) - server , computer science , idle , server farm , sleep mode , mode (computer interface) , sleep (system call) , state (computer science) , load balancing (electrical power) , computer network , reboot , real time computing , operating system , distributed computing , client–server model , algorithm , power (physics) , mathematics , physics , geometry , power consumption , quantum mechanics , grid
In most optimal VM placement algorithms, the first step to determine the proper time horizon, Tfor the prediction of the expected maximum future load, L. However, T is dependent on the proper knowledge of therequired time for servers to switch from their initial SLEEP/ACTIVE state to the next desired state. The activitiesimplemented by this policy are (a) to relocate the VM from an encumbered server, a server that operates in anundesirably high regime with applications forecasted to rise their burdens to compute in the subsequent reallocationcycles; (b) to conduct VM migration from servers that operate within the undesirable regime to shift the server toa SLEEP mode; (c) putting an idle server to SLEEP mode and rebooting the servers from the SLEEP mode at highcluster 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.