2017 IEEE 41st Annual Computer Software and Applications Conference (COMPSAC) 2017
DOI: 10.1109/compsac.2017.94
|View full text |Cite
|
Sign up to set email alerts
|

Container Rebalancing: Towards Proactive Linux Containers Placement Optimization in a Data Center

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
3
3
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 7 publications
0
5
0
Order By: Relevance
“…The scheduling mechanism proposed in [16] migrates only long-lived containers as they occupy the resources for a long time. First, long-lived containers are arranged with respect to the CPU resources they consume.…”
Section: Algorithmic Approachesmentioning
confidence: 99%
See 1 more Smart Citation
“…The scheduling mechanism proposed in [16] migrates only long-lived containers as they occupy the resources for a long time. First, long-lived containers are arranged with respect to the CPU resources they consume.…”
Section: Algorithmic Approachesmentioning
confidence: 99%
“…3. Then, move to the nearest regional node (i.e., attached parent node -lines [16][17] to place the remaining microservices in case all the microservices are not placed. 4.…”
Section: Greedy First Fit Algorithm (Gff)mentioning
confidence: 99%
“…Load balancing strategy [10] is applied only on long-lived containers that occupy the resources for a long duration. Longlived containers are arranged according to the CPU resource they require; then highly occupied hosts are selected to swap containers with low occupied hosts.…”
Section: Related Workmentioning
confidence: 99%
“…The work presented in U-Chupala et al (2017) proposes a resource-aware placement scheme to boost the performance in a heterogeneous cluster through a proactive-optimisation based on rapid live migrations, preparing the system for future workloads, especially on busy clusters, and minimising the interference with the main scheduler. Ma et al (2016) proposed Libra, another optimisation broker-based scheduling architecture and strategy, to maximise the network isolation of the containers' virtual links bound to the physical nodes' links.…”
Section: Related Workmentioning
confidence: 99%