Improved approximation algorithms for multiprocessor indivisible coflow scheduling

IF 1.1 4区数学 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Journal of Combinatorial Optimization Pub Date : 2025-05-25 DOI:10.1007/s10878-025-01325-z

Mingyang Gong, Guangting Chen, Guohui Lin, Bing Su

引用次数: 0

Abstract

Coflow scheduling is a challenging optimization problem that underlies many data transmission and parallel computing applications. In this paper, we study the indivisible coflow scheduling problem on parallel identical machines with the objective to minimize the makespan, i.e., the completion time of the last flow. In our problem setting, the number of the input/output ports in each machine is a fixed constant, each port has a unit capacity, and all the flows inside a coflow should be scheduled on the same machine. We present a \((2 + \epsilon )\)-approximation algorithm for the problem, for any \(\epsilon > 0\), in which the number of machines can be either a fixed constant or part of the input.

查看原文本刊更多论文

多处理机不可分共流调度的改进逼近算法

协同流调度是一个具有挑战性的优化问题，是许多数据传输和并行计算应用的基础。本文研究了并行相同机器上的不可分共流调度问题，其目标是最小化最大完工时间，即最后一个流程的完成时间。在我们的问题设置中，每台机器的输入/输出端口的数量是一个固定的常数，每个端口都有一个单位容量，并且coflow中的所有流都应该安排在同一台机器上。对于任意\(\epsilon > 0\)，我们提出了一个\((2 + \epsilon )\) -近似算法，其中机器数量可以是固定常数或输入的一部分。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Combinatorial Optimization 数学-计算机：跨学科应用

CiteScore

2.00

自引率

10.00%

发文量

审稿时长

6 months

期刊介绍： The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering. The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.