On the Asymptotic Optimality of Work-Conserving Disciplines in Completion Time Minimization
Wenxin Li

TL;DR
This paper proves that work-conserving disciplines are asymptotically optimal for minimizing total completion time under certain stochastic assumptions, and provides tight bounds on their competitive ratios for flow time.
Contribution
It establishes the asymptotic optimality of work-conserving disciplines for completion time minimization and derives tight bounds on their competitive ratios for flow time.
Findings
Work-conserving disciplines are asymptotically optimal for total completion time.
Derived tight upper bounds on competitive ratios for flow time.
Provided analysis under mild stochastic assumptions.
Abstract
In this paper, we prove that under mild stochastic assumptions, work-conserving disciplines are asymptotic optimal for minimizing total completion time. As a byproduct of our analysis, we obtain tight upper bound on the competitive ratios of work-conserving disciplines on minimizing the metric of flow time.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Optimization Algorithms · Optimization and Search Problems · Optimization and Packing Problems
