2017 International Conference on Computer and Applications (ICCA) 2017
DOI: 10.1109/comapp.2017.8079781
|View full text |Cite
|
Sign up to set email alerts
|

Load Balancing Based Task Scheduling with ACO in Cloud Computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
26
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 69 publications
(26 citation statements)
references
References 11 publications
0
26
0
Order By: Relevance
“…Ants can find a high-quality solution in a search space and they share their knowledge in the form of pheromone update strategy and solve the problem efficiently. Further, ACO has been utilized in solving the load balancing problem that results in reduced computational time and has an efficient global search that does not fall into local optima [96]- [98], [106].…”
mentioning
confidence: 99%
“…Ants can find a high-quality solution in a search space and they share their knowledge in the form of pheromone update strategy and solve the problem efficiently. Further, ACO has been utilized in solving the load balancing problem that results in reduced computational time and has an efficient global search that does not fall into local optima [96]- [98], [106].…”
mentioning
confidence: 99%
“…Gupta and Garg 8 present a mechanism called load balancing ant colony optimization (LB‐ACO). It aims to reduce the execution time while providing the load balancing.…”
Section: Related Workmentioning
confidence: 99%
“…It is the total amount of time required to complete a group of tasks which indicates the maximum completion time. It can be calculated by [15][16][17] Makespan =∑ (2) Makespan = Max (Comp_Time [i, j])…”
Section: Relatedworkmentioning
confidence: 99%