Zero queueing delay is highly desirable in large-scale computing systems. Existing work has shown that it can be asymptotically achieved by using the celebrated Power-of-$d$-choices (pod) policy with a probe overhead $d = ω\left(\frac{\log N}{1-λ}\right)$, and it is impossible when $d = O\left(\frac{1}{1-λ}\right)$, where $N$ is the number of servers and $λ$ is the load of the system. However, these results are based on the model where each job is an indivisible unit, which does not capture the parallel structure of jobs in today's predominant parallel computing paradigm.
This paper thus considers a model where each job consists of a batch of parallel tasks. Under this model, we propose a new notion of zero (asymptotic) queueing delay that requires the job delay under a policy to approach the job delay given by the max of its tasks' service times, i.e., the job delay assuming its tasks entered service right upon arrival. This notion quantifies the effect of queueing on a job level for jobs consisting of multiple tasks, and thus deviates from the conventional zero queueing delay for single-task jobs in the literature.
We show that zero queueing delay for parallel jobs can be achieved using the batch-filling policy (a variant of the celebrated pod policy) with a probe overhead $d = ω\left(\frac{1}{(1-λ)\log k}\right)$ in the sub-Halfin-Whitt heavy-traffic regime, where $k$ is the number of tasks in each job { and $k$ properly scales with $N$ (the number of servers)}. This result demonstrates that for parallel jobs, zero queueing delay can be achieved with a smaller probe overhead. We also establish an impossibility result: we show that zero queueing delay cannot be achieved if $d = \exp\left({o\left(\frac{\log N}{\log k}\right)}\right)$.
Necessity of Future Information in Admission Control
我们研究了预测信息的必要性,在一类排队接纳控制问题,其中系统管理员被允许转移传入的工作到一个固定的速度,以尽量减少排队延迟所经历的接纳工作。Spencer等人(2014)表明,通过以前瞻窗口的形式访问未来信息,可以显着改善系统的延迟性能,在此期间,可以显示未来到达和服务的时间。他们证明,虽然在繁忙的交通状况下,最优在线策略下的延迟发散到无穷大,但它可以通过利用未来的信息来保持有界。然而,Spencer等人(2014)的分流政策要求在繁忙的交通状况下,前瞻窗口的长度以非平凡的速度增长到无穷大,并且在未来信息较少的情况下是否仍然可以实现实质性的性能改善仍然是开放的。我们在很大程度上解决了这个问题,方法是建立一个渐近紧的下界,确定需要多少未来信息才能实现卓越的性能,这与Spencer et al.(2014)的上界相匹配,直到常数乘法因子。因此,我们的研究结果表明,系统的大流量延迟性能是高度敏感的未来可用的信息量。我们的证明是基于分析一定的游览概率的输入样本路径,并利用政策的分流决策和随后的服务器空闲,这可能是独立的利益相关的动态资源分配问题之间的连接。