2018
DOI: 10.1007/978-981-13-2514-4_2
|View full text |Cite
|
Sign up to set email alerts
|

An Enhanced Task Scheduling in Cloud Computing Based on Hybrid Approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 21 publications
(22 citation statements)
references
References 16 publications
0
22
0
Order By: Relevance
“…For instance, it used the speed of the ACO algorithm in finding good solutions swiftly and shared interaction of bees and sharing information by waggle dancing from Artificial Bee Colony (ABC). Simulation results showed a good improvement in makespan, execution time, and so on [38].…”
Section: Related Workmentioning
confidence: 88%
“…For instance, it used the speed of the ACO algorithm in finding good solutions swiftly and shared interaction of bees and sharing information by waggle dancing from Artificial Bee Colony (ABC). Simulation results showed a good improvement in makespan, execution time, and so on [38].…”
Section: Related Workmentioning
confidence: 88%
“…Also, LCFP may face starvation problem. Alworafi et al [16] introduced Hybrid-SJF-LJF (HSLJF) algorithm which combines LJF and SJF algorithms. HSLJF sorts the tasks in ascending order, then selects one task based on SJF and another task based on LSF.…”
Section: Related Workmentioning
confidence: 99%
“…In this section, the performance of the proposed algorithm, GTSwDVG, is compared with four algorithms: SJF, which uses the shortest job first criterion, LCFP [9], which is based on the Longest Cloudlet Fastest Processing Element (LCFP), HSLJF [16], which combines shortest job first and longest job first criteria and CSSA [14], which uses one of the strategies of bee families called the social spider strategy.…”
Section: Simulationmentioning
confidence: 99%
See 1 more Smart Citation
“…To handle the starvation problem the researchers in [111] proposed a hybrid shortest-longest scheduling algorithm. They considered the capabilities of each VM and the length of the task to allocate the tasks to the most convenient VMs, so as to overcome the starvation problem and also satisfying and considering both the provider and user requirements.…”
Section: Schedulingmentioning
confidence: 99%