Proceedings of the Thirteenth EuroSys Conference 2018
DOI: 10.1145/3190508.3190549
|View full text |Cite
|
Sign up to set email alerts
|

Medea

Abstract: The rise in popularity of machine learning, streaming, and latencysensitive online applications in shared production clusters has raised new challenges for cluster schedulers. To optimize their performance and resilience, these applications require precise control of their placements, by means of complex constraints, e.g., to collocate or separate their long-running containers across groups of nodes. In the presence of these applications, the cluster scheduler must attain global optimization objectives, such a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
19
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 47 publications
(19 citation statements)
references
References 26 publications
(14 reference statements)
0
19
0
Order By: Relevance
“…A similar approach is proposed in [47], where the authors present a solution to manage clusters shared among Hadoop applications and more traditional Web systems. Another recent contribution addresses the scheduling of long-running applications in shared clusters [52]. The authors couple a task-based scheduler, to cope with short jobs, and an ILP formulation that takes care of scheduling long-running applications while minimizing costs and violations of placement constraints, thus achieving up to 32% shorter median execution time in comparison to a baseline constraint-aware scheduler.…”
Section: Run Time Approachesmentioning
confidence: 99%
“…A similar approach is proposed in [47], where the authors present a solution to manage clusters shared among Hadoop applications and more traditional Web systems. Another recent contribution addresses the scheduling of long-running applications in shared clusters [52]. The authors couple a task-based scheduler, to cope with short jobs, and an ILP formulation that takes care of scheduling long-running applications while minimizing costs and violations of placement constraints, thus achieving up to 32% shorter median execution time in comparison to a baseline constraint-aware scheduler.…”
Section: Run Time Approachesmentioning
confidence: 99%
“…Paragon 9 and Quasar 10 predict and detect the resource interference between jobs through workload profiling and application classification, and select the optimal node accordingly. In addition, there were studies that supported granular partitioning to analyze and eliminate the cases of interference between latency‐sensitive jobs and best‐effort batch jobs when deploying the application to the node 11‐16 . These studies focused on resource guarantee and efficient idle resource consumption.…”
Section: Related Workmentioning
confidence: 99%
“…In addition, there were studies that supported granular partitioning to analyze and eliminate the cases of interference between latency-sensitive jobs and best-effort batch jobs when deploying the application to the node. [11][12][13][14][15][16] These studies focused on resource guarantee and efficient idle resource consumption. On the other hand, detailed control of the resources used by best-effort batch jobs with a low priority was not studied thoroughly.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations