10.1184/R1/6603485.v1
Mor Harchol-Balter
Mor
Harchol-Balter
Cuihong Li
Cuihong
Li
Takayuki Osogami
Takayuki
Osogami
Alan Wolf
Alan
Wolf
Mark S. Squillante
Mark S.
Squillante
Analysis of Task Assignment with Cycle Stealing
Carnegie Mellon University
1990
computer sciences
1990-10-01 00:00:00
Journal contribution
https://kilthub.cmu.edu/articles/journal_contribution/Analysis_of_Task_Assignment_with_Cycle_Stealing/6603485
The problem of task assignment in a distributed server system is considered, where short jobs are
separated from long jobs, but short jobs may be run in the long job partition if it is idle (cycle
stealing). Jobs are assumed to be non-preemptible. New techniques are presented for analyzing this
problem, both in the case of immediate dispatch of jobs to hosts and in the case of a central queue.
The analysis is approximate, but can be made as close to exact as desired. Analysis is validated via
simulation. Results of the analysis show that cycle stealing can reduce mean response time for short
jobs by orders of magnitude, while long jobs are only slightly penalized.