2014 26th International Teletraffic Congress (ITC) 2014
DOI: 10.1109/itc.2014.6932946
|View full text |Cite
|
Sign up to set email alerts
|

Energy-aware job assignment in server farms with setup delays under LCFS and PS

Abstract: Abstract-We consider the job (or task) assignment problem to heterogeneous parallel servers, where servers can be switched off to save energy. However, switching a server back on involves a constant server-specific delay. We will use one step of policy iteration from a starting policy such as Bernoulli splitting, in order to derive efficient job assignment (dispatching) policies that minimize the long-run average cost. In our earlier work, we assumed FCFS scheduling at the servers. In this paper, we focus on L… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 15 publications
(5 citation statements)
references
References 26 publications
0
5
0
Order By: Relevance
“…When the average file size l is large, µ is relatively smaller under condition (19) than that under (20), and thus the sleeping probability is low under condition (19), which makes the working power consumption in the second term and the switching cost in the third term completely outweigh the static power consumption saved from sleeping, so the total power consumption monotonically increases with P t . Otherwise, a larger µ under condition (20) leads to a higher sleeping probability than that in (19), so the static power consumption saved from sleeping plays the main role at first and the total power decreases with P t . However, P (N,Pt) will go up as P t increases further.…”
Section: B Selection Of Sleeping Threshold and Transmit Powermentioning
confidence: 99%
See 1 more Smart Citation
“…When the average file size l is large, µ is relatively smaller under condition (19) than that under (20), and thus the sleeping probability is low under condition (19), which makes the working power consumption in the second term and the switching cost in the third term completely outweigh the static power consumption saved from sleeping, so the total power consumption monotonically increases with P t . Otherwise, a larger µ under condition (20) leads to a higher sleeping probability than that in (19), so the static power consumption saved from sleeping plays the main role at first and the total power decreases with P t . However, P (N,Pt) will go up as P t increases further.…”
Section: B Selection Of Sleeping Threshold and Transmit Powermentioning
confidence: 99%
“…The Poisson model has been used a lot when random traffic arrivals are considered in energy-saving design [7]- [10], [20]- [22]. However, in practice the data traffic usually has bursty features.…”
Section: Introductionmentioning
confidence: 99%
“…For example, server farms are vital components in cloud computing and advanced multi-server queueing models that include features essential for characterizing scheduling performance as well as energy efficiency need to be developed. Recent results in this area include [29,40,41] and analyze fundamental structural properties of policies that optimize the performance-energy trade-off. On the other hand, several works exist [20,67] that employ energy-driven Markov Decision Process (MDP) solutions.…”
Section: Energy-aware Network and Service Controlmentioning
confidence: 99%
“…In this setting the use of MDP (Markov Decision Process) and Policy Iteration has been recently considered by Gebrehiwot et al in [28], where the data center is assumed to consist of two kinds of servers: normal always-on servers and instant-off servers, which go to sleep immediately after queue empties, i.e., there are no idle timers, and an explicit near optimal policy is obtained for minimizing the ERWS metric that uses as state the number of jobs in the queues and the busy/sleep status. Also, size-aware approaches with MDP have been recently applied by Hyytiä et al in [24,25].…”
Section: Optimal Sleep State Control In M/g/1 Queuementioning
confidence: 99%