Efficient Approximation Algorithms for Scheduling Coflows With Precedence Constraints in Identical Parallel Networks to Minimize Weighted Completion Time

This article focuses on the problem of coflow scheduling with precedence constraints 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...

Full description

Bibliographic Details

Published in:	IEEE transactions on services computing Vol. 17; no. 5; pp. 2349 - 2364
Main Author:	Chen, Chi-Yeh
Format:	Journal Article
Language:	English
Published:	IEEE 01.09.2024
Subjects:	Approximation algorithms coflow Data centers datacenter network identical parallel network Job shop scheduling Linear programming Optimal scheduling precedence constraints Processor scheduling scheduling algorithms Servers
ISSN:	1939-1374, 2372-0204
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!