2017
DOI: 10.1016/j.jestch.2016.11.006
|View full text |Cite
|
Sign up to set email alerts
|

Optimizing VM allocation and data placement for data-intensive applications in cloud using ACO metaheuristic algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
42
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 77 publications
(42 citation statements)
references
References 19 publications
0
42
0
Order By: Relevance
“…The constraint satisfaction rule for makespan minimization adopted in [22] failed to address the issue of transition loops which causes delay in convergence and longer time of the assigned couplings. The proposed research will focus on improving the rule by injecting the mechanism of loop free SPT algorithm to improve on convergence, makespan time and cost in a multi-dimensional spaces.…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…The constraint satisfaction rule for makespan minimization adopted in [22] failed to address the issue of transition loops which causes delay in convergence and longer time of the assigned couplings. The proposed research will focus on improving the rule by injecting the mechanism of loop free SPT algorithm to improve on convergence, makespan time and cost in a multi-dimensional spaces.…”
Section: Methodsmentioning
confidence: 99%
“…A rule for pheromone updates should be strategized and also promote faster convergence. 4 Shabeera et al [22] Heuristic method that reduced bandwidth usage and cross network traffic by placing required number of data in PMs and VMs which are physically closer.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…VMs are installed on computing environments for efficient resource utilization and processing. In [14], experimental analysis is conducted to evaluate the number of VMs for a physical machine in energy efficient way. However, the authors concluded that the capacity of VMs and their collocation reduce the job completion time.…”
Section: Problem Statementmentioning
confidence: 99%
“…A VM allocation policy for data intensive applications is implemented [11] which would select a subset of available PMs for placement. This selection using Ant Colony Optimization would be such that the VMs demand must be fulfilled based on applications request.…”
Section: Related Workmentioning
confidence: 99%