2022
DOI: 10.1007/s10586-022-03561-y
|View full text |Cite
|
Sign up to set email alerts
|

A two-stage scheduling method for deadline-constrained task in cloud computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 44 publications
0
2
0
Order By: Relevance
“…The IGA algorithm consists of the following steps: (1) design the encoding and initialize the population; (2) evaluate fitness as 1/𝐶, where 𝐶 is the total cost; (3) perform selection, crossover, and mutation operations; (4) perform greedy selection operation; (5) generate a new population; (6) repeat steps (2)-( 5) iteratively until the termination criteria are met; (7) decode and obtain the optimal scheduling solution.…”
Section: Proposed Algorithm: Igamentioning
confidence: 99%
See 1 more Smart Citation
“…The IGA algorithm consists of the following steps: (1) design the encoding and initialize the population; (2) evaluate fitness as 1/𝐶, where 𝐶 is the total cost; (3) perform selection, crossover, and mutation operations; (4) perform greedy selection operation; (5) generate a new population; (6) repeat steps (2)-( 5) iteratively until the termination criteria are met; (7) decode and obtain the optimal scheduling solution.…”
Section: Proposed Algorithm: Igamentioning
confidence: 99%
“…Task scheduling has been an important problem in the field of cloud services [1][2][3] . Most studies focus on independent tasks scheduling, such as proposing ant colony algorithms [4] , and whale optimization algorithms [5] to reduce costs [6,7] . However, approximate query task scheduling for BDAaaS involves the sequential dependencies between tasks.…”
Section: Introductionmentioning
confidence: 99%