Efficient Approximation Algorithms for Scheduling Coflows With Total Weighted Completion Time in Identical Parallel Networks

This article addresses the scheduling problem of coflows in identical parallel networks, a well-known <inline-formula><tex-math notation="LaTeX">\mathcal {NP}</tex-math> <mml:math><mml:mi mathvariant="script">NP</mml:mi></mml:math><inl...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on cloud computing Ročník 12; číslo 1; s. 116 - 129
Hlavní autor: Chen, Chi-Yeh
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 01.01.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Approximation
Approximation algorithms
Cloud computing
coflow
Completion time
Data centers
datacenter network
identical parallel network
Job shop scheduling
Linear programming
Mathematical analysis
Optimal scheduling
Processor scheduling
Scheduling
Scheduling algorithms
Servers
ISSN:2168-7161, 2372-0018
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This article addresses the scheduling problem of coflows in identical parallel networks, a well-known <inline-formula><tex-math notation="LaTeX">\mathcal {NP}</tex-math> <mml:math><mml:mi mathvariant="script">NP</mml:mi></mml:math><inline-graphic xlink:href="chen-ieq1-3340729.gif"/> </inline-formula>-hard problem. We consider both flow-level scheduling and coflow-level scheduling problems. In the flow-level scheduling problem, flows within a coflow can be transmitted through different network cores, while in the coflow-level scheduling problem, flows within a coflow must be transmitted through the same network core. The key difference between these two problems lies in their scheduling granularity. Previous approaches relied on linear programming to solve the scheduling order. In this article, we enhance the efficiency of solving by utilizing the primal-dual method. For the flow-level scheduling problem, we propose an approximation algorithm that achieves approximation ratios of <inline-formula><tex-math notation="LaTeX">6-\frac{2}{m}</tex-math> <mml:math><mml:mrow><mml:mn>6</mml:mn><mml:mo>-</mml:mo><mml:mfrac><mml:mn>2</mml:mn><mml:mi>m</mml:mi></mml:mfrac></mml:mrow></mml:math><inline-graphic xlink:href="chen-ieq2-3340729.gif"/> </inline-formula> and <inline-formula><tex-math notation="LaTeX">5-\frac{2}{m}</tex-math> <mml:math><mml:mrow><mml:mn>5</mml:mn><mml:mo>-</mml:mo><mml:mfrac><mml:mn>2</mml:mn><mml:mi>m</mml:mi></mml:mfrac></mml:mrow></mml:math><inline-graphic xlink:href="chen-ieq3-3340729.gif"/> </inline-formula> for arbitrary and zero release times, respectively, where <inline-formula><tex-math notation="LaTeX">m</tex-math> <mml:math><mml:mi>m</mml:mi></mml:math><inline-graphic xlink:href="chen-ieq4-3340729.gif"/> </inline-formula> represents the number of network cores. Additionally, for the coflow-level scheduling problem, we introduce an approximation algorithm that achieves approximation ratios of <inline-formula><tex-math notation="LaTeX">4m+1</tex-math> <mml:math><mml:mrow><mml:mn>4</mml:mn><mml:mi>m</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math><inline-graphic xlink:href="chen-ieq5-3340729.gif"/> </inline-formula> and <inline-formula><tex-math notation="LaTeX">\text{4}m</tex-math> <mml:math><mml:mrow><mml:mtext>4</mml:mtext><mml:mi>m</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="chen-ieq6-3340729.gif"/> </inline-formula> for arbitrary and zero release times, respectively. The algorithm presented in this article has practical applications in data centers, such as those operated by Google or Facebook. The simulated results demonstrate the superior performance of our algorithms compared to previous approach, emphasizing their practical utility.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2168-7161
2372-0018
DOI:10.1109/TCC.2023.3340729