NPSCS: Non-preemptive Stochastic Coflow Scheduling with Time-Indexed LP Relaxation

IEEE Transactions on Network and Service Management（2021）

引用 2|浏览0

暂无评分

摘要

Coflows model a scheduling setting that is commonly found in a variety of applications in distributed and cloud computing. A stochastic coflow task contains a set of parallel flows with randomly distributed sizes. Further, many applications require non-preemptive scheduling of coflow tasks. This article gives an approximation algorithm on the weighted expected completion time for non-preemptive st...

查看译文

关键词

Task analysis,Scheduling,Processor scheduling,Servers,Stochastic processes,Approximation algorithms,Job shop scheduling

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要