2019
DOI: 10.1007/978-3-030-33582-3_22
|View full text |Cite
|
Sign up to set email alerts
|

Convergence-Based Task Scheduling Techniques in Cloud Computing: A Review

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
1
1

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 19 publications
0
4
0
Order By: Relevance
“…The utilization of virtual machine V M j is defined by 1 j , as indicated in Equation (13). Equation ( 14) defines the maximum time virtual machines work in parallel to accomplish the task.…”
Section: Problem Formulationmentioning
confidence: 99%
See 1 more Smart Citation
“…The utilization of virtual machine V M j is defined by 1 j , as indicated in Equation (13). Equation ( 14) defines the maximum time virtual machines work in parallel to accomplish the task.…”
Section: Problem Formulationmentioning
confidence: 99%
“…As a result of the broad solution space and the complex existence of heterogeneous resources in cloud computing, the task scheduling problem falls into the group of NP-hard issues [12][13][14][15].…”
Section: Introductionmentioning
confidence: 99%
“…The optimization problems that have piqued interest in metaheuristic approaches range widely in complexity, from single to multi-objective, continuous to discrete, constrained to unconstrained and largescale global optimization problems. Therefore, solving these problems is not always easy due to their complicated behaviour [1][9] [16][17] [18]. Studies of swarm behavior can perhaps be regarded as a field of artificial intelligence (AI), is saddled with the responsibilities of collecting information about the behaviour of organisms in self organized environment.…”
Section: Introductionmentioning
confidence: 99%
“…As a result of the broad solution space and complex existence of heterogeneous resources in cloud computing, the task scheduling problem falls into the group of NP-hard problems [12][13][14][15].…”
Section: Introductionmentioning
confidence: 99%