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

Energy-Efficient Independent Task Scheduling in Cloud Computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 17 publications
0
5
0
Order By: Relevance
“…Sobhanayak et al [20] presented a combined method using GA and the Bacterial Foraging (BF) algorithms in the computing cloud. This algorithm has two main objectives.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Sobhanayak et al [20] presented a combined method using GA and the Bacterial Foraging (BF) algorithms in the computing cloud. This algorithm has two main objectives.…”
Section: Related Workmentioning
confidence: 99%
“…These links are demonstrated as a Directed Acyclic Graph (DAG), and it is comprised of vertices that represent computations and directed edges that represent the dependencies between those vertices. The DAG graph is a directional graph and does not have a path whose beginning and end are the same and one of its important applications is in routing algorithms [20].…”
Section: Introductionmentioning
confidence: 99%
“…A natural resource allocation technique assigns the work to available VMs across hosts. When working with the load balancing issue, we can use heuristic techniques, which rely on genetic algorithms to explore the exponential solution space [41]. It uses an objective function (genetic) to choose a single solution from the population [42].…”
Section: Genetic Algorithm For Task Schedulingmentioning
confidence: 99%
“…The meta-heuristic algorithm belongs to the dynamic task scheduling method, which combines the random algorithm and the local search algorithm, and can dynamically search for the optimal solution in the problem solution space. For example, the particle swarm optimization algorithm can use a group of particles to quickly search for the optimal solution in the solution space of the problem, and in the search process, evaluate the quality of the solution through the fitness function, and finally converge to a stable value [11].…”
Section: Introductionmentioning
confidence: 99%