2000 character limit reached
Scheduling in the Presence of Data Intensive Compute Jobs (1912.03348v2)
Published 6 Dec 2019 in cs.PF, cs.DC, cs.IT, and math.IT
Abstract: We study the performance of non-adaptive scheduling policies in computing systems with multiple servers. Compute jobs are mostly regular, with modest service requirements. However, there are sporadic data intensive jobs, whose expected service time is much higher than that of the regular jobs. Forthis model, we are interested in the effect of scheduling policieson the average time a job spends in the system. To this end, we introduce two performance indicators in a simplified, only-arrival system. We believe that these performance indicators are good predictors of the relative performance of the policies in the queuing system, which is supported by simulations results.