Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Energy consumption in data centers with deterministic setup times
Download
index.pdf
Date
2017
Author
Kara, Aytaç
Metadata
Show full item record
Item Usage Stats
199
views
75
downloads
Cite This
Data centers, which are networks consisting of thousands of computers, are central objects in the global computation infrastructure. Typical data centers today may consume as much electricity as a small town. Thus, it is of interest to build models of these centers that allow one to study / optimize their energy usage. One of the models for the energy usage based on queueng theory is the one developed in “Exact Solutions for M/M/c/Setup Queues” by Tuan Phung-Duc. The same work carries out a stationary analysis of the developed model to compute the long term average energy cost per unit time. The model of Phung-Duc assumes that the data center consists of c servers and that the servers are in one of the following three modes: running, stopped or in setup. The setup mode is assumed to last a random exponentially distributed time. We modify this model as follows: we replace exponentially distributed setup times with a fixed deterministic setup time. We call the resulting model M/M/c/dSetup: We approximate the long term average cost per unit time via simulation and compare this cost with that of the M/M/c/Setup system. Our main finding are as follows: the average energy cost of these systems provide good approximations of one another. Secondly, the average energy cost of the M/M/c/Setup system provides a lower bound for that of the M/M/c/dSetup system.
Subject Keywords
Electric power consumption
,
Energy consumption
,
Power resources
,
Queuing theory.
URI
http://etd.lib.metu.edu.tr/upload/12621413/index.pdf
https://hdl.handle.net/11511/26801
Collections
Graduate School of Applied Mathematics, Thesis
Suggestions
OpenMETU
Core
On the parametric and nonparametric prediction methods for electricity load forecasting
Erişen, Esra; İyigün, Cem; Department of Industrial Engineering (2013)
Accurate electricity load forecasting is of great importance in deregulated electricity markets. Market participants can reap significant financial benefits by improving their electricity load forecasts. Electricity load exhibits a complex time series structure with nonlinear relationships between the variables. Hence, new models with higher capabilities to capture such nonlinear relationships need to be developed and tested. In this thesis, we present a parametric and a nonparametric method for short-term ...
Optimizing Multipath Routing With Guaranteed Fault Tolerance in Internet of Things
Hasan, Mohammed Zaki; Al-Turjman, Fadi (2017-10-01)
Internet of Things (IoTs) refers to the rapidly growing network of connected objects and people that are able to collect and exchange data using embedded sensors. To guarantee the connectivity among these objects and people, fault tolerance routing has to be significantly considered. In this paper, we propose a bio-inspired particle multi-swarm optimization (PMSO) routing algorithm to construct, recover, and select k-disjoint paths that tolerates the failure while satisfying the quality of service parameter...
SWARM-based data delivery framework in the Ad Hoc Internet of Things
Hasan, Mohammed Zaki; Al-Turjman, Fadi (2017-12-08)
Internet of Things (IoTs) refers to the rapidly growing network of connected objects that are able to collect and exchange data using embedded sensors. To guarantee the connectivity among these objects and devices, fault tolerant routing has been received a significant attention in recent years. In this paper, we propose a bio-inspired particle multi-swarm optimization (PMSO) routing algorithm to construct, recover and select k-disjoint paths that tolerates the failure while satisfying quality of service (Q...
Energy-efficient scheduling of packet transmissions over wireless networks
Balaji, Prabhakar; Uysal, Elif; El Gamal, Abbas (null; 2002-06-23)
The paper develops algorithms for minimizing the energy required to transmit packets in a wireless environment. It is motivated by the following observation: In many channel coding schemes it is possible to significantly lower the transmission energy by transmitting packets over a long period of time. Based on this observation, we show that for a variety of scenarios the offline energy-efficient transmission scheduling problem reduces to a convex optimization problem. Unlike for the special case of a single...
Multi-hazard reliability of electric power transmission networks with spatially correlated components
Altay, Umut; Dener Akkaya, Ayşen.; Department of Statistics (2019)
Many network systems such as, gas and water pipelines, power transmission and distribution systems, highways and communication systems extend spatially over large geographical regions. Such network systems are composed of interconnected components which form paths. Correlation, resulting from similar topography, soil conditions as well as external loading due to the same environmental factors, between the behaviour of those elements should be taken into consideration and be quantified. In this respect the s...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. Kara, “Energy consumption in data centers with deterministic setup times,” M.S. - Master of Science, Middle East Technical University, 2017.
