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

优化超图基多项式建模冗余调度排队中的作业占用

Optimizing hypergraph-based polynomials modeling job-occupancy in queueing with redundancy scheduling

Daniel Brosch, Monique Laurent, Andries Steenkamp

AI总结:

研究两类由均匀超图边索引的多元多项式,用于建模冗余调度排队中的作业占用,通过利用对称性证明其全局最小值在均匀分布处取得,并展示更强的凸性。

摘要:

我们研究了两类多元多项式,其变量由均匀超图的边索引,系数取决于边的并集的某些模式。这些多项式自然产生,用于建模一些具有冗余调度策略的排队问题中的作业占用。Cardinaels、Borst和van Leeuwaarden(arXiv:2005.14566, 2020)提出的问题是:决定它们在标准单纯形上的全局最小值是否在均匀概率分布处取得。通过利用这些多项式的对称性质,我们对第一类给出了肯定回答,对第二类给出了部分结果,其中我们实际上证明了这些多项式在单纯形上具有更强的凸性性质。

英文摘要:

We investigate two classes of multivariate polynomials with variables indexed by the edges of a uniform hypergraph and coefficients depending on certain patterns of union of edges. These polynomials arise naturally to model job-occupancy in some queuing problems with redundancy scheduling policy. The question, posed by Cardinaels, Borst and van Leeuwaarden (arXiv:2005.14566, 2020), is to decide whether their global minimum over the standard simplex is attained at the uniform probability distribution. By exploiting symmetry properties of these polynomials we can give a positive answer for the first class and partial results for the second one, where we in fact show a stronger convexity property of these polynomials over the simplex.

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

↑