2018
DOI: 10.1016/j.ins.2017.01.005
|View full text |Cite
|
Sign up to set email alerts
|

MLBox: Machine learning box for asymptotic scheduling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(2 citation statements)
references
References 24 publications
0
2
0
Order By: Relevance
“…Under certain conditions, they could easily discover the best scheduling algorithm, prove its optimality and compute its asymptotic throughput. Vasile et al [27] proposed a scheduling algorithm for different types of computation requests: independent tasks, like a bag of tasks model, or tasks with dependencies modeled as directed acyclic graphs, and they will be scheduled for execution in a cloud data center. The tasks in the requests are scheduled based on the available resources using the scheduling algorithm suitable for each request.…”
Section: Related Workmentioning
confidence: 99%
“…Under certain conditions, they could easily discover the best scheduling algorithm, prove its optimality and compute its asymptotic throughput. Vasile et al [27] proposed a scheduling algorithm for different types of computation requests: independent tasks, like a bag of tasks model, or tasks with dependencies modeled as directed acyclic graphs, and they will be scheduled for execution in a cloud data center. The tasks in the requests are scheduled based on the available resources using the scheduling algorithm suitable for each request.…”
Section: Related Workmentioning
confidence: 99%
“…Since machine learning could serve to make complex algorithms concise and efficient, more studies [9][10][11][12] tend to tackle the scheduling problems with machine learning-based methods in recent years. Many scholars are interested in studying the combination of the two, and put forward some practical cases [13][14][15]. Machine learning-based methods could be classified into many categories, the best known of which are reinforcement learning [16][17][18], random forests [19,20], and neural networks [21,22].…”
Section: Introductionmentioning
confidence: 99%