arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2011.10521cs.PFmath.PR
收藏

多服务器作业的零开销

Zero Queueing for Multi-Server Jobs

Weina Wang, Qiaomin Xie, Mor Harchol-Balter

摘要:

当今的云计算主要由多服务器作业主导。这些作业同时请求多个服务器,并在作业期间保留所有这些服务器。多服务器作业给传统的每服务器一个作业的模型增加了很多复杂性:到达的作业可能不“适合”可用的服务器,可能必须排队,从而阻止后面的到达并使服务器空闲。从调度的角度来看,对多服务器作业调度系统几乎一无所知;甚至理解确切的稳定区域也是一个非常困难的问题。在本文中,我们研究了一个多服务器作业调度模型的缩放制度,在系统中的服务器数量的增长。具体来说,我们考虑一个系统与多个类别的工作,从不同的类的工作可以要求不同数量的服务器,并有不同的服务时间分布,和工作服务在先到先得的顺序。多服务器作业模型开辟了新的扩展机制,其中作业所需的服务器数量和系统负载都随服务器总数而扩展。在这些缩放制度,我们得出的第一个结果的稳定性,takeing概率,并在系统中的工作的数量为每个类的瞬态分析。特别是,我们得到了充分的条件为零。我们的分析介绍了一种新的方法提取信息的李雅普诺夫漂移,它可以适用于更广泛的问题,在混沌系统。

英文摘要:

Cloud computing today is dominated by multi-server jobs. These are jobs that request multiple servers simultaneously and hold onto all of these servers for the duration of the job. Multi-server jobs add a lot of complexity to the traditional one-job-per-server model: an arrival might not "fit" into the available servers and might have to queue, blocking later arrivals and leaving servers idle. From a queueing perspective, almost nothing is understood about multi-server job queueing systems; even understanding the exact stability region is a very hard problem. In this paper, we investigate a multi-server job queueing model under scaling regimes where the number of servers in the system grows. Specifically, we consider a system with multiple classes of jobs, where jobs from different classes can request different numbers of servers and have different service time distributions, and jobs are served in first-come-first-served order. The multi-server job model opens up new scaling regimes where both the number of servers that a job needs and the system load scale with the total number of servers. Within these scaling regimes, we derive the first results on stability, queueing probability, and the transient analysis of the number of jobs in the system for each class. In particular we derive sufficient conditions for zero queueing. Our analysis introduces a novel way of extracting information from the Lyapunov drift, which can be applicable to a broader scope of problems in queueing systems.

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

↑