The delay time-based server selection algorithm for energy-efficient redundant execution of processes Online publication date: Mon, 12-Oct-2015
by Tomoya Enokido; Dilawaer Duolikun; Makoto Takizawa
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 15, No. 4, 2015
Abstract: It is critical to discuss how to realise not only fault-tolerant but also energy-efficient server cluster systems. In this paper, we propose the redundant delay time based (RDTB) algorithm to select multiple servers for redundantly and energy-efficiently performing application processes. In the RDTB algorithm, it is not necessary to collect a state of every replica to estimate the energy consumption of servers. We evaluate the RDTB algorithm compared with the basic round-robin (RR) and redundant power consumption laxity-based (RPCLB) algorithms. From the evaluation, the total energy consumption of homogeneous and heterogeneous clusters in the RDTB algorithm can be maximally reduced to 36% and 19% of the RR algorithm, respectively. The number of messages exchanged between a load balancer and servers in the RDTB algorithm can be maximally reduced to 90% of the RPCLB algorithm. Therefore, the RDTB algorithm is more useful than the RR and RPCLB algorithms for real environment.
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 Communication Networks and Distributed Systems (IJCNDS):
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