The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
Proceedings of the 2018 1st International Conference on Internet and E-Business 2018
DOI: 10.1145/3230348.3230369
|View full text |Cite
|
Sign up to set email alerts
|

Consolidating VMs in Green Cloud Computing Using Harmony Search Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
4
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 19 publications
0
4
0
Order By: Relevance
“…Best Fit Decreasing (BFD) and First Fit Decreasing (FFD) are similar to BF and FF, but they are preceded by VMs sorting in a decreasing order. On the other hand, there are also some meta-heuristic methods that have been proposed to find the near-optimal places for VMs such as Ant Colony Optimization (ACO) [42], [43], Genetic Algorithm (GA) [44], [45], Simulated Annealing (SA) [46], Improved Lévy based on Whale Optimization Algorithm (ILWOA) [47], Glowworm Swarm Optimisation [48], Harmony Search (HS) [49], Krill Herd (KH) algorithm [50], and hybridized algorithm [51]. A recent detailed work has been introduced to review the state-of-the-art multiobjective techniques based on meta-heuristic algorithms [52].…”
Section: Vm Placementmentioning
confidence: 99%
“…Best Fit Decreasing (BFD) and First Fit Decreasing (FFD) are similar to BF and FF, but they are preceded by VMs sorting in a decreasing order. On the other hand, there are also some meta-heuristic methods that have been proposed to find the near-optimal places for VMs such as Ant Colony Optimization (ACO) [42], [43], Genetic Algorithm (GA) [44], [45], Simulated Annealing (SA) [46], Improved Lévy based on Whale Optimization Algorithm (ILWOA) [47], Glowworm Swarm Optimisation [48], Harmony Search (HS) [49], Krill Herd (KH) algorithm [50], and hybridized algorithm [51]. A recent detailed work has been introduced to review the state-of-the-art multiobjective techniques based on meta-heuristic algorithms [52].…”
Section: Vm Placementmentioning
confidence: 99%
“…Fathi and Khanli [56] have suggested a new method based on the HS algorithm for the active allotment of VMs, which has been proven to be effective in power management systems. To solve the problem of virtual machine allocation, this algorithm has been used to detect an optimal solution.…”
Section: Harmony Search Algorithmmentioning
confidence: 99%
“…The nature of the harmony search algorithm adopts itself to suit both discrete and continuous variable problems [18]. Virtual machine consolidation is performed using harmony memory search by reducing the number of active machines along with the quality of service requirement [19]. Ant-colony-based consolidation of VMs is utilized to minimize energy consumption with acceptable performance levels [20].…”
Section: Related Workmentioning
confidence: 99%
“…The migration time involves the communication overhead drawn in by the memory reserved by the VM. The communication over head is calculated as Mbw = bw/2, MT = (Mem-size/Mbw) (19) where migration bandwidth (Mbw) and migration time (MT) depends on the memory size (Mem-size) of the VM to be migrated.…”
Section: Maximum Migration With Least Resource Requestmentioning
confidence: 99%