Rightsizing Clusters for Time-Limited Tasks

2021 IEEE 14th International Conference on Cloud Computing (CLOUD)(2021)

引用 0|浏览12
暂无评分
摘要
Cluster rightsizing facilitates cost-performance trade-off in resource-constrained clouds. Multidimensional bin-packing algorithms can address this rightsizing problem, but these assume that every task on the cluster is always active. In contrast, real-world tasks may be active only during specific time-periods, which allows reusing resources via time sharing and optimal packing. This motivates ou...
更多
查看译文
关键词
Cloud computing,Costs,Conferences,Clustering algorithms,Approximation algorithms,Linear programming,Filling
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要