2021
DOI: 10.1007/s10586-021-03481-3
|View full text |Cite
|
Sign up to set email alerts
|

An enhanced multi-objective fireworks algorithm for task scheduling in fog computing environment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 25 publications
(8 citation statements)
references
References 33 publications
0
8
0
Order By: Relevance
“…The execution time of VMs is used as the evaluation of load balancing, as shown by Eqs. ( 13) and (14).…”
Section: Definition Of Load Balancingmentioning
confidence: 99%
See 1 more Smart Citation
“…The execution time of VMs is used as the evaluation of load balancing, as shown by Eqs. ( 13) and (14).…”
Section: Definition Of Load Balancingmentioning
confidence: 99%
“…Secondly, the execution time of each task is measured to balance the overloaded VMs, which can obtain the best utilization of system resources. Yadav et al [14] proposed an algorithm for fireworks display based on opposition learning and differential evolution technology. Kruekaew et al [15] proposed using a multi-objective task scheduling optimization based on the artificial bee colony algorithm with a Q-learning algorithm, which adopting Qlearning algorithm to strengthen the learning ability of artificial bee colony algorithm.…”
Section: Resource Scheduling Algorithmmentioning
confidence: 99%
“…The fog computing in other words referred to as edge computing that address such drawbacks by offering elastic services and resources to the end‐users at the network's edge, but cloud computing focus on providing resources scattered throughout the network. Fog nodes are infrastructures or facilities that offer resources for services 23 …”
Section: Proposed Designmentioning
confidence: 99%
“…Let us assume that first type requests have access to server and buffer, while second type requests -to server and orbit. Let us consider two types of priority scheduling algorithmspreemptive and non-preemptive scheduling [20], [21], [29], [30].…”
Section: Mathematical Modelmentioning
confidence: 99%