2014
DOI: 10.1007/978-3-662-44917-2_55
|View full text |Cite
|
Sign up to set email alerts
|

An Estimation-Based Task Load Balancing Scheduling in Spot Clouds

Abstract: Abstract. Cloud computing is a computing paradigm in which users can rent computing resources from service providers according to their requirements. Cloud computing based on the spot market helps a user to obtain resources at a lower cost. However, these resources may be unreliable. In this paper, we propose an estimation-based distributed task workflow scheduling scheme that reduces the estimated generation compared to Genetic Algorithm (GA). Moreover, our scheme executes a user's job within selected instanc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 4 publications
(2 reference statements)
0
2
0
Order By: Relevance
“…Jung et. al. propose multi-user workload scheduling on various CUs based on genetic algorithms [20]. Beyond resource allocation and scheduling, a major challenge in CaaS frameworks is the varying delay in the completion of various multimedia processing workloads [4], [21].…”
Section: B Related Workmentioning
confidence: 99%
“…Jung et. al. propose multi-user workload scheduling on various CUs based on genetic algorithms [20]. Beyond resource allocation and scheduling, a major challenge in CaaS frameworks is the varying delay in the completion of various multimedia processing workloads [4], [21].…”
Section: B Related Workmentioning
confidence: 99%
“…The subtraction in (10) contrasts between the workload's CUS requirement, r w [t], and the TTC requirement, d w [t]. In addition, following proportional fairness problems in other resource allocation work (notably in cellular network scheduling algorithms [18]), we opted for the use of the natural logarithm in the demand side of the objective function and pursue the maximization of f (s w [t]).…”
Section: Workload Execution With Confirmed Ttcmentioning
confidence: 99%