Computation and Transmission Rate Based Algorithm
for Reducing the Total Power Consumption
Tomoya Enokido1, Ailixier Aikebaier2
and Makoto Takizawa2
1Rissho University
4-2-16 Osaki, Shinagawa-ku, Tokyo 141-8602, Japan
eno@ris.ac.jp
2Seikei University
3-3-1 Kichijoji-kitamachi, Musashino-shi, Tokyo 180-8633,
Japan
Tel. +81-422-37-3724, 3738
Fax. +81-422-37-3871
{alisher.akber,
makoto.takizawa}@computer.org
Abstract
In information systems, it is critical to reduce the
total electrical power consumption of computers
and networks in order to realize the digital ecosystems
and the green IT technologies. The extended
power consumption laxity-based (EPCLB) algorithm is
proposed to select a server in a set of servers
so as to not only satisfy deadline constraint but also
reduce the total power consumption of servers in
general applications. However, each time a load balancer
receives a new request, the load balancer
has to collect status of each server and calculate the
estimated power consumption for the request in
the EPCLB algorithm. Hence, the computation and
communication overhead to estimate the power
consumption is large on the load balancer if the number
of clients is increased. In addition, the
status of each server might be changed during the estimation
process. Then, it is difficult to correctly
estimate the power consumption. In this paper, we newly
propose an algorithm to select a server in
a set of servers so that the total power consumption of
servers and the overhead of a load balancer
can be reduced. We evaluate the algorithm in terms of the
power consumption of servers and the
overhead of a load balancer compared with the EPCLB and
traditional round-robin (RR) algorithms.
Journal of Wireless Mobile Networks, Ubiquitous
Computing, and Dependable Applications (JoWUA),
Vol. 2, No. 2, pp. 1-18, June 2011 [pdf]