2016
DOI: 10.1109/tcc.2015.2481401
|View full text |Cite
|
Sign up to set email alerts
|

Energy-Efficient Virtual Machines Scheduling in Multi-Tenant Data Centers

Abstract: Despite the dramatic improvements achieved in building energy-efficient electronic devices, the amount of electricity consumed worldwide to power the global information technology infrastructure has grown tremendously in the past decade. In this paper, we propose algorithms to reduce energy consumption by data centers by considering the placement of virtual machines onto the servers in the data center intelligently. We formulate this problem as an integer programming problem, prove it is NP-hard, then explore … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
45
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 77 publications
(45 citation statements)
references
References 21 publications
0
45
0
Order By: Relevance
“…The assignment of VMs to the servers and flows to the links in clusters are performed using a heuristic. The [11] also studied the joint optimization of server and network power consumption. They formulated the problem as an integer programming problem, proved that it is NP-hard and then proposed two greedy algorithms for VM scheduling.…”
Section: Related Workmentioning
confidence: 99%
“…The assignment of VMs to the servers and flows to the links in clusters are performed using a heuristic. The [11] also studied the joint optimization of server and network power consumption. They formulated the problem as an integer programming problem, proved that it is NP-hard and then proposed two greedy algorithms for VM scheduling.…”
Section: Related Workmentioning
confidence: 99%
“…In Oktopus, the focus is on providing bandwidth guarantees for virtual datacenters in the form of virtual machines all connected to a virtual switch, called virtual clusters in [4], and also collections of virtual clusters where the virtual switches of these clusters are connected to a root virtual switch, called oversubscribed virtual clusters in [4] (as is noted in, for example, [14], the Amazon EC2 cloud embeds tenant requests in the form of a virtual cluster). It is remarked in [4] that other virtual datacenters in the (topological) form of hypercubes, multidimensional meshes, de Bruijn networks, and so on might also be offered to users (though this possibility is not seriously examined).…”
Section: Oktopusmentioning
confidence: 99%
“…ant colony optimization algorithms in [66], greedy algorithms in [48], and linear programming in [14,65]. Of course, with a fixed DCN as the host, it is possible that the virtualization problem becomes solvable in polynomial time (though, in our view, unlikely for existing DCNs).…”
Section: Oktopusmentioning
confidence: 99%
See 2 more Smart Citations