A pathwise comparison of parallel queues
A pathwise comparison of parallel queues
复制标题
并行队列的路径比较
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
P. Moyal
中科院分区：
文献类型：
--
作者：
P. Moyal
通过对多个服务器队列进行路径比较，我们展示了在什么意义上最好是在“先到先得”中拥有更多的服务器，或者等价地，在“加入最短工作负载”策略下并行拥有更多的队列。这个比较结果是基于基弗和沃尔福威茨的递归表示，并在一个非质量保守推广的舒尔-凸半序，显示在什么意义上，它是更好地发送到服务器的最小负载。我们还表明，这种路径的结果并不适用于一般的半循环政策介绍了Scheller-Wolf，并提出了一个较弱的排序，适合这类较大的模型。
By conducting a pathwise comparison of multiple server queues, we show in what sense it is better to have more servers in ‘First Come, First Served’ or equivalently, more queues in parallel under the policy ‘Join the Shortest Workload’. This comparison result is based on the recursive representation of Kiefer and Wolfowitz, and on a non-mass conservative generalization of the Schur-Convex semi-ordering, showing in what sense it is better to send jobs to the server of least load. We also show that this pathwise result does not hold true in general for the semi-cyclic policies introduced by Scheller-Wolf, and propose a weaker ordering that suits this larger class of models.