A new class of Markov-chain-driven scheduling policies for multiresource jobs is throughput-optimal and admits additively tight mean response time bounds under preemptive, non-preemptive, and setup-time preemption models.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PF 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Improving Multiresource Job Scheduling with Markovian Service Rate Policies
A new class of Markov-chain-driven scheduling policies for multiresource jobs is throughput-optimal and admits additively tight mean response time bounds under preemptive, non-preemptive, and setup-time preemption models.