arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.09745cs.PF
收藏

弹性与非弹性作业的最优资源分配

Optimal Resource Allocation for Elastic and Inelastic Jobs

Benjamin Berg, Mor Harchol-Balter, Benjamin Moseley, Weina Wang, Justin Whitehouse

摘要:

现代数据中心的任务是处理由各种类别的作业组成的异构工作负载。这些类在它们的到达率、大小分布和作业并行性方面有所不同。关于可并行性,有些作业是弹性的,这意味着它们可以在许多服务器上线性并行。其他作业是无弹性的,这意味着它们只能在单个服务器上运行。虽然作业类可能有很大的不同,但它们通常被迫共享一个集群。在异构作业之间共享集群时,必须决定如何在每个时刻为每个作业分配服务器。在本文中,我们设计和分析的分配政策,旨在最大限度地减少平均响应时间跨作业,作业的响应时间是从它到达时,直到它完成的时间。我们在一个随机环境中模拟这个问题,每个工作可能是弹性或非弹性的。作业大小是从指数分布中得出的,但系统是未知的。我们发现,在常见的情况下,弹性工作平均大于非弹性工作,最优分配策略是非弹性优先,给予非弹性工作抢占优先权的弹性工作。我们通过引入一个新的样本路径参数得到这个结果。我们还表明,存在弹性优先(优先考虑弹性作业)比非弹性优先的情况。然后,我们提供了第一次分析的平均响应时间下的弹性第一和非弹性第一,利用最近的技术来解决高维马尔可夫链。

英文摘要:

Modern data centers are tasked with processing heterogeneous workloads consisting of various classes of jobs. These classes differ in their arrival rates, size distributions, and job parallelizability. With respect to paralellizability, some jobs are elastic, meaning they can parallelize linearly across many servers. Other jobs are inelastic, meaning they can only run on a single server. Although job classes can differ drastically, they are typically forced to share a single cluster. When sharing a cluster among heterogeneous jobs, one must decide how to allocate servers to each job at every moment in time. In this paper, we design and analyze allocation policies which aim to minimize the mean response time across jobs, where a job's response time is the time from when it arrives until it completes. We model this problem in a stochastic setting where each job may be elastic or inelastic. Job sizes are drawn from exponential distributions, but are unknown to the system. We show that, in the common case where elastic jobs are larger on average than inelastic jobs, the optimal allocation policy is Inelastic-First, giving inelastic jobs preemptive priority over elastic jobs. We obtain this result by introducing a novel sample path argument. We also show that there exist cases where Elastic-First (giving priority to elastic jobs) performs better than Inelastic-First. We then provide the first analysis of mean response time under both Elastic-First and Inelastic-First by leveraging recent techniques for solving high-dimensional Markov chains.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑