Coflow has emerged as a fundamental application-layer abstraction in distributed systems, representing communication dependencies and enabling collaborative management of related flows to enhance job completion efficiency. To meet the increasing bandwidth demands of modern data center networks (DCNs), optical circuit switches are widely deployed due to their high capacity and energy efficiency. Simultaneously, DCN deployments are evolving towards heterogeneous parallel architectures, where multiple independent optical circuit switching (OCS) cores operate concurrently to facilitate bandwidth expansion and incremental upgrades. However, existing research on coflow scheduling in multi-core switching fabrics primarily focuses on electrical packet switching (EPS) networks, with a few known results on OCS networks without or with a poor performance guarantee. This paper studies the coflow scheduling problem in multi-core OCS networks under the not-all-stop (i.e., asynchronous) reconfiguration model, focusing on two major challenges of overcoming cross-core coupling for inter-core traffic allocation and satisfying the constraints of port exclusivity and reconfiguration overhead for intra-core circuit scheduling. To minimize total weighted coflow completion time (CCT), we propose an efficient algorithm by integrating linear programming-guided (LP-guided) global coflow ordering, inter-core flow allocation and intra-core circuit scheduling that achieves approximation ratios of 8K and 8K+1 for zero and arbitrary release times of coflows, respectively, where K is the number of OCS cores. This framework is also applicable to H-core EPS networks, providing approximation guarantees of 4H and 4H+1 for zero-time and arbitrary-time release, respectively.

翻译：共流已成为分布式系统中一种基础的应用层抽象，它表示通信依赖关系，并通过协同管理相关流来提升任务完成效率。为满足现代数据中心网络日益增长的带宽需求，光路交换机因其高容量和高能效而被广泛部署。同时，数据中心网络正朝着异构并行架构演进，其中多个独立的光路交换内核并行运行，以支持带宽扩展和增量升级。然而，现有关于多核交换结构中共流调度的研究主要集中在电分组交换网络上，而在光路交换网络中仅有少数已知结果，且性能保证较差或缺失。本文研究了非全停（即异步）重配置模型下多核光路交换网络中的共流调度问题，聚焦于克服核间流量分配中的跨核耦合，以及满足核内电路调度中的端口独占性和重配置开销约束这两大挑战。为最小化加权共流完成时间，我们提出了一种高效算法，该算法结合了线性规划引导的全局共流排序、核间流分配和核内电路调度，对于零释放时间和任意释放时间的共流，分别实现了$8K$和$8K+1$的近似比，其中$K$为光路交换内核数量。该框架也适用于$H$核电分组交换网络，对于零时和任意时间释放，分别提供了$4H$和$4H+1$的近似保证。