The Evaluation of the Improved Redundant Power Consumption Laxity-Based (IRPCLB) Algorithm in Homogeneous and Heterogeneous Clusters

In a server cluster, one server is usually selected to perform a request process from a client. Once the server stops by fault, the client is suspended to wait for a reply. Even if the request is performed on another server on detection of fault of the server, some QoS requirement like response time may not be satisfied. Hence, each request is redundantly performed on multiple servers to be tolerant of server faults. Here, more number of servers a request process is redundantly performed, the more reliable but the more amount of electric power is consumed. Thus, it is critical to discuss how to realize a reliable and energy-aware server cluster in presence of server faults. The redundant power consumption laxity-based (RPCLB) algorithm is proposed to redundantly and energy-efficiently perform a request process in our previous studies. In this paper, we newly discuss an improved RPCLB (IRPCLB) algorithm where once a process successfully terminates on one server, meaningless redundant processes are forced to terminate on the other servers. We show the total power consumption of servers and response time of each process can be reduced in the IRPCLB algorithm than the RPCLB and round-robin (RR) algorithms in both heterogeneous and homogeneous clusters.

[1]  Tomoya Enokido,et al.  An Energy-Efficient Redundant Execution Algorithm by Terminating Meaningless Redundant Processes , 2013, 2013 IEEE 27th International Conference on Advanced Information Networking and Applications (AINA).

[2]  George Coulouris,et al.  Distributed systems - concepts and design , 1988 .

[3]  Tomoya Enokido,et al.  An Integrated Power Consumption Model for Distributed Systems , 2013, IEEE Transactions on Industrial Electronics.

[4]  Tomoya Enokido,et al.  A Redundant Power Consumption Laxity-Based (RPCLB) Algorithm for Computation Type Applications , 2012, 2012 Seventh International Conference on Broadband, Wireless Computing, Communication and Applications.

[5]  Fred B. Schneider,et al.  Replication management using the state-machine approach , 1993 .

[6]  Ricardo Bianchini,et al.  Analytical and experimental evaluation of cluster-based network servers , 2000, World Wide Web.

[7]  Tomoya Enokido,et al.  Process Allocation Algorithms for Saving Power Consumption in Peer-to-Peer Systems , 2011, IEEE Transactions on Industrial Electronics.

[8]  Tomoya Enokido,et al.  A Model for Reducing Power Consumption in Peer-to-Peer Systems , 2010, IEEE Systems Journal.

[9]  Tomoya Enokido,et al.  Energy-Efficient Server Selection Algorithm Based on the Extended Simple Power Consumption Model , 2012, 2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems.

[10]  Karl S. Hemmert.  Green HPC: From Nice to Necessity , 2010, Comput. Sci. Eng..

[11]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[12]  Thomas L. Sterling,et al.  Advanced Architectures and Execution Models to Support Green Computing , 2010, Computing in Science & Engineering.