We propose an asynchronous iterative scheme which allows a set of interconnected nodes to distributively reach an agreement to within a pre-specified bound in a finite number of steps. While this scheme could be adopted in a wide variety of applications, we discuss it within the context of task scheduling for data centers. In this context, the algorithm is guaranteed to approximately converge to the optimal scheduling plan, given the available resources, in a finite number of steps. Furthermore, being asynchronous, the proposed scheme is able to take in account the uncertainty that can be introduced from straggler nodes or communication issues in the form of latency variability while still converging to the target objective. In addition, by using extensive empirical evaluation through simulations we show that the proposed method exhibits state-of-the-art performance.

中文翻译：

---

使用异步有限时间分布式协调机制的数据中心中的CPU调度

我们提出了一种异步迭代方案，该方案允许一组互连的节点以有限的步骤在预定范围内分布式达成协议。尽管此方案可以在多种应用中采用，但我们在数据中心任务调度的上下文中对其进行了讨论。在这种情况下，在给定可用资源的情况下，可以保证算法在有限的步骤中大致收敛于最佳调度计划。此外，由于是异步的，所以所提出的方案能够考虑到可以从散布的节点或通信问题以等待时间可变性的形式引入的不确定性，同时仍然收敛到目标目标。此外，