arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2001.09921math.PR
收藏

具有一般服务器-作业类兼容性的队列中JSQ的稳定性

Stability of JSQ in queues with general server-job class compatibilities

James Cruise, Matthieu Jonckheere, Seva Shneer

摘要:

我们考虑泊松流的指数分布的工作到达超图的队列的每个边缘。在到达时,传入作业被根到对应顶点中的最短队列。这推广了许多已知的模型,如幂d负载平衡和JSQ(加入最短队列)上的通用图。我们提供了一个通用的条件,该模型的稳定性。我们表明,一些图形拓扑结构导致的能力损失,这意味着更多的限制性稳定条件比,例如,完全图。

英文摘要:

We consider Poisson streams of exponentially distributed jobs arriving at each edge of a hypergraph of queues. Upon arrival, an incoming job is rooted to the shortest queue among the corresponding vertices. This generalizes many known models such as power-of-d load balancing and JSQ (join the shortest queue) on generic graphs. We provide a generic condition for stability of this model. We show that some graph topologies lead to a loss of capacity, implying more restrictive stability conditions than in, e.g., complete graphs.

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

↑