Power Consumption-Based Server Selection Algorithms for Communication-Based Systems

Abstract

We have to reduce the total electrical power consumption in information systems. In this paper, we consider communication based applications where a server transmits a large volume of data to a client like file transfer protocol (FTP). We discuss a power consumption model for communication-based applications, where the total power consumption of a server depends on the total transmission rate and number of clients where the server concurrently transmits files. A client has to select a server in a set of possible servers, each of which holds a file, so that the power consumption of the server is reduced. We evaluate a pair of PCB (power consumption-based) and TRB (transmission rate-based) algorithms to select a server. In the evaluation, we show the total power consumption can be reduced by the PCB and TRB algorithms compared with the traditional round-robin (RR) algorithm and PCB is more practical than TRB.

An extended power consumption-based algorithm for communication-based applications

“…Net, http://www.wattsupmeters.com/ secure/products.php?pn=0 (2009)] in the paper (Enokido et al 2010b). Here, the power consumption of each server can be measured every one second.…”

“…In the papers (Enokido et al , 2010b, the following algorithm to allocate each client c s with the transmission rate tr ts (s) is discussed for each time s: Suppose a server s t is selected by three clients c 1 ; c 2 ; c 3 ðC t ðsÞ ¼ fc 1 ; c 2 ; c 3 gÞ and the maximum transmission rate Fig. 3 Power consumption rate of server s t (W/s) maxtr t (s) of the server s t is 6 Mbps at time s as shown in Fig.…”

“…In the papers (Enokido et al , 2010b, we discussed a power consumption model for transmitting files from servers to clients where the electric power consumption of the server to transmit a file to a client depends on the transmission rate of the server on the experimental results ). Here, a pair of PCB (power consumption-based) and TRB (transmission rate-based) algorithms are proposed to select a server in a set of servers so that the total power consumption can be reduced.…”

“…Here, a pair of PCB (power consumption-based) and TRB (transmission rate-based) algorithms are proposed to select a server in a set of servers so that the total power consumption can be reduced. In the evaluation (Enokido et al 2010b), the total power consumption and the total transmission time are shown to be reduced in the PCB and TRB algorithms compared with the traditional round-robin (RR) algorithm [Weighted Least Connection (WLC), http://www.linuxvir tualserver.org/docs/scheduling.html (1998); Weighted Round Robin (WRR), http://www.linuxvirtualserver.org/ docs/scheduling.html (1998)]. The PCB algorithm is more useful than TRB algorithm since it is difficult to estimate the transmission rates to each client in the TRB algorithm.…”

Energy-efficient dynamic clusters of servers

“…In CP processes such as scientific computation applications, CPU resources are mainly consumed on servers. Here, the simple and extended power consumption models [2,4,7,8] are discussed. The power consumption rate of a server to perform CP processes is maximum if at least one process is performed and minimum if no process is performed.…”