We consider the coflow scheduling problem in the non-clairvoyant setting, assuming that flow sizes are realized on-line according to given probability distributions. The goal is to minimize the weighted average completion time of coflows in expectation. We first obtain inequalities for this problem that are valid for all non-anticipative order-based rate-allocation policies and define a polyhedral relaxation of the performance space of such scheduling policies. This relaxation is used to analyze the performance of a simple priority policy in which the priority order is computed by Sincronia from expected flow sizes instead of their unknown actual values. We establish a bound on the approximation ratio of this priority policy with respect to the optimal priority policy for arbitrary probability distributions of flow sizes (with finite first and second moments). Tighter upper bounds are obtained for some specific distributions. Extensive numerical results suggest that performance of the proposed policy is much better than the upper bound.

翻译：我们研究非先知设定下的协同流调度问题，假设流大小根据给定概率分布在线实现。目标是最小化协同流加权平均完成时间的期望值。我们首先获得了适用于所有非预见性基于顺序的速率分配策略的不等式，并定义了此类调度策略性能空间的多面体松弛。该松弛用于分析一种简单优先级策略的性能，其中优先级顺序由Sincronia根据期望流大小（而非未知实际值）计算得出。我们针对任意流大小概率分布（具有有限一阶矩和二阶矩）建立了该优先级策略相对于最优优先级策略的近似比界。针对某些特定分布获得了更紧的上界。大量数值结果表明，所提出策略的实际性能远优于理论上的界。