Container Rebalancing: Towards Proactive Linux Containers Placement Optimization In A Data Center

2017 IEEE 41ST ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE (COMPSAC), VOL 1(2017)

引用 18|浏览27
暂无评分
摘要
Similar to Virtualization, Linux Containers (LXC) provides high-performance, lightweight computing resource allocation and isolation. Each LXC container has a resource overhead smaller than that of a virtual machine, leading to significantly lower container migration time and making frequent container placement modification a viable optimization technique. Traditional container scheduling mechanisms do not leverage this property of LXC. Generally, a scheduler tries to find the most optimal placement for a new container; the allocated host then executes the scheduled container until the end of the container's life cycle. This strategy works fine for short-lived containers. With a long-lived container such as a server process becoming more and more common, and the container placement calculated at the beginning of the execution may not remain optimal during the container's lifetime, since the other containers are moving in and out of the cluster. This research proposes container rebalancing, a novel scheduling mechanism with a rebalancing process working alongside a scheduling process. The container rebalancing method increases LXC cluster utilization while maintaining minimal interference with the scheduling process. This is done by continuously modifying container placement, by using the rebalancing process, in order to load-balance utilization of each host in the LXC cluster. LXC cluster simulation driven by Google's cluster data is used to verify the feasibility of container rebalancing. Simulation results show an observable increase in container scheduled rate and cluster utilization with no drawback, suggesting that container rebalancing is a promising method.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要