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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on cloud computing Vol. 12; no. 1; pp. 116 - 129
Main Author:	Chen, Chi-Yeh
Format:	Journal Article
Language:	English
Published:	Piscataway IEEE 01.01.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!