Presents the first throughput-optimal family of preemptive and non-preemptive scheduling policies for continuous multiresource job models using load-dependent discretization.
IEEE Transactions on Information theory 39(2), 466–478 (1993)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PF 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Throughput-Optimal Multiresource-Job Scheduling with Continuous Requirement Distribution
Presents the first throughput-optimal family of preemptive and non-preemptive scheduling policies for continuous multiresource job models using load-dependent discretization.