2022
DOI: 10.1007/978-3-031-18344-7_13
|View full text |Cite
|
Sign up to set email alerts
|

Analysis of Load Balancing Algorithms Used in the Cloud Computing Environment: Advantages and Limitations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 13 publications
0
4
0
Order By: Relevance
“…The suggested algorithm creates five groups to split tasks belonging to each group and share characteristics such as user type, task type, job size, and work delay. In order to run task-based efficient programs on distributed operating systems and save energy, a real-time dynamic scheduling system was developed [21]. There is currently no optimal multiprocessor solution for the NP-hard job scheduling problem.…”
Section: Previous Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The suggested algorithm creates five groups to split tasks belonging to each group and share characteristics such as user type, task type, job size, and work delay. In order to run task-based efficient programs on distributed operating systems and save energy, a real-time dynamic scheduling system was developed [21]. There is currently no optimal multiprocessor solution for the NP-hard job scheduling problem.…”
Section: Previous Workmentioning
confidence: 99%
“…Almost all of these studies have not covered the idea of lowering energy usage and scheduling. The references [20,21,24,25] have used edge computing methodologies. They also employ cloud computing in many aspects of their work.…”
Section: Comparative Analysismentioning
confidence: 99%
“…They are also prone to imbalanced trade‐offs between exploration and exploitation and suffer from premature convergence. These limitations of meta‐heuristic algorithms have maximized the probability of resulting in sub‐optimal solutions that directly influence service provisioning performance with respect to the satisfaction of required QoS objectives 13 . Moreover, the majority of existing TS works fail to capture the potential features of CC including dynamism, elasticity, and heterogeneity in the utilization of computing resources which results in ignoring the needs of user QoS 14 .…”
Section: Introductionmentioning
confidence: 99%
“…These limitations of meta-heuristic algorithms have maximized the probability of resulting in sub-optimal solutions that directly influence service provisioning performance with respect to the satisfaction of required QoS objectives. 13 Moreover, the majority of existing TS works fail to capture the potential features of CC including dynamism, elasticity, and heterogeneity in the utilization of computing resources which results in ignoring the needs of user QoS. 14 Thus, meta-heuristic-based optimization algorithms that can potentially handle huge search space are necessary for scheduling tasks in large-scale applications.…”
Section: Introductionmentioning
confidence: 99%