Improved Redundant Power Consumption Laxity-Based Algorithm for Server Clusters
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.
KeywordsGreen computing Power consumption model IRPCLB algorithm Redundant execution Reliable server cluster
- 1.Hemmert S (2010) Green HPC: from nice to necessity. In: Proceeding of the computing in science and engineering, pp 8–10Google Scholar
- 2.Lamport R, Shostak R, Pease M (1982) The Byzantine generals problems. ACM Trans Program Lang Syst 4(3):382–401Google Scholar
- 5.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–283Google Scholar
- 6.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–567Google Scholar
- 7.Job Scheduling Algorithms in Linux Virtual Server, http://www.linuxvirtualserver.org/docs/ scheduling.html