Abstract
A client usually issues a request to one server in a cluster of servers and the server sends a reply to the client. Once the server stops by fault, the client is suspended to wait for a reply. In order to be tolerant of server faults, each request is redundantly performed on multiple servers. Here, the more number of servers a request process is redundantly performed, the more reliable but the more amount of electric energy is consumed. Thus, it is critical to discuss how to realize energy-aware, robust clusters of servers. In this paper, we newly propose the improved redundant power consumption laxity-based (IRPCLB) algorithm where once a process successfully terminates on one server, meaningless redundant processes are not performed on the other servers. We show the total power consumption of servers is reduced in the IRPCLB algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Hemmert S (2010) Green HPC: from nice to necessity. In: Proceeding of the computing in science and engineering, pp 8–10
Lamport R, Shostak R, Pease M (1982) The Byzantine generals problems. ACM Trans Program Lang Syst 4(3):382–401
Enokido T, Aikebaier A, Takizawa M (2010) A model for reducing power consumption in peer-to-peer systems. IEEE Syst J 4(2):221–229
Enokido T, Aikebaier A, Takizawa M (2011) Process allocation algorithms for saving power consumption in peer-to-peer systems. IEEE Trans Ind Electron 58(6):2097–2105
Enokido T, Takizawa M (2012) Energy-efficient server selection algorithms based on the extended simple power consumption model. In: Proceedings of the 6th international conference on complex, intelligent and software intensive systems (CISIS-2012), pp 276–283
Enokido T, Aikebaier A, Takizawa M (2012) A redundant power consumption laxity-based (RPCLB) algorithm for computation type applications. In: Proceedings of the 14th international symposium on multimedia network systems and applications (MNSA-2012), pp 562–567
Job Scheduling Algorithms in Linux Virtual Server, http://www.linuxvirtualserver.org/docs/ scheduling.html
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Enokido, T., Aikebaier, A., Takizawa, M. (2013). Improved Redundant Power Consumption Laxity-Based Algorithm for Server Clusters. In: Park, J.J., Barolli, L., Xhafa, F., Jeong, H.Y. (eds) Information Technology Convergence. Lecture Notes in Electrical Engineering, vol 253. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-6996-0_43
Download citation
DOI: https://doi.org/10.1007/978-94-007-6996-0_43
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-6995-3
Online ISBN: 978-94-007-6996-0
eBook Packages: EngineeringEngineering (R0)