Analyzing Cluster Scheduling Schemes by Probabilistic Model Checking (Addendum)
Sprache des Titels:
This short note presents an addendum to the previously published report ?Analyzing Clus- ter Scheduling Schemes by Probabilistic Model Checking? in which we have used the prob- abilistic model checker PRISM various cluster scheduling schemes that were introduced by Do, Vu, Tran, and Nguyen in their paper ?A generalized model for investigating scheduling schemes in computational clusters? and analyzed by simulation there. Here we model and analyze two new policies for the ?Separate Queue? scheme where each server has a separate job queue; in these policies the mean response time of new jobs is taken into account. It is shown that the policies may perform better than the original one; for a certain range of parameters, however, they also may perform worse.