Improved approximation algorithms for multiprocessor indivisible coflow scheduling

Mingyang Gong (), Guangting Chen (), Guohui Lin () and Bing Su ()
Additional contact information
Mingyang Gong: University of Alberta
Guangting Chen: Zhejiang University of Water Resources and Electric Power
Guohui Lin: University of Alberta
Bing Su: Xi’an Technological University

Journal of Combinatorial Optimization, 2025, vol. 49, issue 5, No 11, 17 pages

Abstract: 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 )$$ ( 2 + ϵ ) -approximation algorithm for the problem, for any $$\epsilon > 0$$ ϵ > 0 , in which the number of machines can be either a fixed constant or part of the input.

Keywords: Scheduling; Multiprocessor; Indivisible Coflow; Approximation Algorithm (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01325-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:49:y:2025:i:5:d:10.1007_s10878-025-01325-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-025-01325-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().