2016 International Conference on Computing, Communication and Automation (ICCCA) 2016
DOI: 10.1109/ccaa.2016.7813746
|View full text |Cite
|
Sign up to set email alerts
|

A genetic algorithm inspired task scheduling in cloud computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
6
4

Relationship

1
9

Authors

Journals

citations
Cited by 44 publications
(18 citation statements)
references
References 11 publications
0
18
0
Order By: Relevance
“…It outperforms an adaptive GA and some other GAs in terms of convergence speed, feasibility and effectiveness. Agarwal and Srivastava [58] proposed a GA for task scheduling in CC, which distributes the loads among VMs effectively to optimize the overall response time. Experimental results show that the proposed algorithm outperforms some existing techniques such as greedy-based techniques and First Come First Serve in terms of overall response time.…”
Section: A Eas In CC and Ecmentioning
confidence: 99%
“…It outperforms an adaptive GA and some other GAs in terms of convergence speed, feasibility and effectiveness. Agarwal and Srivastava [58] proposed a GA for task scheduling in CC, which distributes the loads among VMs effectively to optimize the overall response time. Experimental results show that the proposed algorithm outperforms some existing techniques such as greedy-based techniques and First Come First Serve in terms of overall response time.…”
Section: A Eas In CC and Ecmentioning
confidence: 99%
“…In [ 36 ], a novel architecture is proposed, in addition to a task scheduling algorithm based on a dynamic scheduling queue algorithm and particle swarm optimization algorithm, and this algorithm fully considers the dynamic characteristic of the cloud computing environment, with experimental results that show the architecture can effectively achieve good performance, load balancing and improvements in resource utilization. In [ 37 ], an improved genetic algorithm for the task scheduling strategy was proposed. Moreover, in some literature, combinations of multiple single algorithms to form a hybrid algorithm for solving the task scheduling problem are proposed.…”
Section: Related Workmentioning
confidence: 99%
“…Contrary to heuristic-based, the meta-heuristic methods search the solution space in a direct manner and produce efficient results on the broad domain problems, but these methods have high time complexity. Meta-heuristic algorithms are also called guided-random search-based methods [18][19][20][21][22][23][24][25][26][27][28][29][30].…”
Section: R Re El La At Te Ed D W Wo or Rk Kmentioning
confidence: 99%