The energy consumption laxity-based algorithm to perform computation processes in virtual machine environments Online publication date: Tue, 03-Sep-2019
by Tomoya Enokido; Dilawaer Duolikun; Makoto Takizawa
International Journal of Grid and Utility Computing (IJGUC), Vol. 10, No. 5, 2019
Abstract: Server cluster systems equipped with virtual machines are widely used to realise scalable and high-performance computing systems. In order to satisfy application requirements like response time, processing loads of virtual machines have to balance with one another in a server cluster. In addition to achieve the performance objectives, the total electric energy of a server cluster to perform application processes has to be reduced. In this paper, the Energy Consumption Laxity Based (ECLB) algorithm is proposed to allocate computation type application processes to virtual machines in a server cluster so that the total electric energy of the server cluster and response time of each process can be reduced. We evaluate the ECLB algorithm compared with basic Round-Robin (RR) algorithm. Evaluation results show the average total electric energy of a server cluster and average response time of each process in the ECLB algorithm can be more reduced than in the RR algorithm.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook