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

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 app...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2010 13th International Conference on Network-Based Information Systems s. 201 - 208
Hlavní autori: Enokido, Tomoya, Aikebaier, Ailixier, Takizawa, Makoto, Deen, S Misbah
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.09.2010
Predmet:
Clustering algorithms
Communication-based Systems
Frequency modulation
Green IT
Load modeling
Power consumption
Power Consumption-Based (PCB) algorithm
Power demand
Resource management
Servers
Transmission Rate-Based (TRB) algorithm
ISBN:1424480531, 9781424480531
ISSN:2157-0418
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
ISBN:1424480531
9781424480531
ISSN:2157-0418
DOI:10.1109/NBiS.2010.80