arXiv:2510.25176cs.LGcs.DC2025-10

协同优化分布式机器学习的CPU调度与数据处理,提升资源效率。

Machine Learning and CPU (Central Processing Unit) Scheduling Co-Optimization over a Network of Computing Centers

  • 将CPU调度与本地模型训练联合优化,动态分配计算资源。
  • 相比现有方案,成本优化差距缩小超50%,且支持低精度通信。
  • 适用于大规模分布式学习,尤其适合资源受限的网络环境。

在人工智能快速发展的背景下,对高效、可扩展计算解决方案的需求日益增长。本文研究分布式机器学习与优化中的计算资源调度问题:给定分布在多个计算节点/服务器上的数据,通过协同优化数据处理与计算资源分配,在每个节点本地使用自身数据进行训练。该问题被建模为联合优化框架,旨在同时优化数据处理效率和计算资源分配。节点间的信息共享网络可随时间变化,但需保持加权平衡以确保算法收敛。所提算法具有全程可行性,即所有迭代中计算资源需求均满足约束。此外,该方案支持信息共享通道上的对数级量化,实现低精度数据交换。以分布式支持向量机(SVM)和回归为例进行验证。通过扰动理论、李雅普诺夫稳定性分析及特征谱分析,证明了算法趋于最优解。相较于现有CPU调度方法,本方案将成本优化差距降低超过50%。

原文摘要 · Abstract (English)

In the rapidly evolving research on artificial intelligence (AI) the demand for fast, computationally efficient, and scalable solutions has increased in recent years. The problem of optimizing the computing resources for distributed machine learning (ML) and optimization is considered in this paper. Given a set of data distributed over a network of computing-nodes/servers, the idea is to optimally assign the CPU (central processing unit) usage while simultaneously training each computing node locally via its own share of data. This formulates the problem as a co-optimization setup to (i) optimize the data processing and (ii) optimally allocate the computing resources. The information-sharing network among the nodes might be time-varying, but with balanced weights to ensure consensus-type convergence of the algorithm. The algorithm is all-time feasible, which implies that the computing resource-demand balance constraint holds at all iterations of the proposed solution. Moreover, the solution allows addressing possible log-scale quantization over the information-sharing channels to exchange log-quantized data. For some example applications, distributed support-vector-machine (SVM) and regression are considered as the ML training models. Results from perturbation theory, along with Lyapunov stability and eigen-spectrum analysis, are used to prove the convergence towards the optimal case. As compared to existing CPU scheduling solutions, the proposed algorithm improves the cost optimality gap by more than $50\%$.

分布式学习资源调度协同优化

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。