论文标题
Coflows的非顾客计划
Non-clairvoyant Scheduling of Coflows
论文作者
论文摘要
考虑了COFLOW调度问题：给定每个端口具有固定容量的输入/输出开关，找到一个调度算法，将Coflow完成时间的加权总和最小化，而Coflow完成时间的加权总和，其中Coflow的每个流量都有每个输入/输出端口的需求，以及Coflow Metter time是COFLOW的时间，以及COFLOW的时间是COF的最后流程。本文的目的是提供理论保证，以近似在非顾客环境中近似Coflow完成时间的总和，在该设置中，仅在Coflow到达时，只有流量的数量，并且揭示了其输入输出端口，而相应输入端口上每个流量的关键需求量是未知的。本文的主要结果是表明所提出的盲型算法为$ 8p $ - apptroximate，其中$ p $是Coflow使用的最大数量输入输出端口对。即使在在线案例中，该结果也会随着时间的流逝而到达，而调度程序必须仅使用因果信息。模拟表明，盲流的实验性能远胜于理论保证。
The coflow scheduling problem is considered: given an input/output switch with each port having a fixed capacity, find a scheduling algorithm that minimizes the weighted sum of the coflow completion times respecting the port capacities, where each flow of a coflow has a demand per input/output port, and coflow completion time is the finishing time of the last flow of the coflow. The objective of this paper is to present theoretical guarantees on approximating the sum of coflow completion time in the non-clairvoyant setting, where on a coflow arrival, only the number of flows, and their input-output port is revealed, while the critical demand volumes for each flow on the respective input-output port is unknown. The main result of this paper is to show that the proposed BlindFlow algorithm is $8p$-approximate, where $p$ is the largest number of input-output port pairs that a coflow uses. This result holds even in the online case, where coflows arrive over time and the scheduler has to use only causal information. Simulations reveal that the experimental performance of BlindFlow is far better than the theoretical guarantee.
