Minimizing Waiting Ratio for Dynamic Workload on Parallel Computers

This paper proposes waiting ratio as a basis in evaluating various scheduling methods for dynamic workloads consisting of multi-processor jobs on parallel computers. We evaluate commonly used methods as well as several methods proposed in this paper by simulation studies. The results indicate that some commonly used methods do not improve the waiting ratios as expected by intuition, while some methods proposed in this paper do greatly improve waiting ratios more than 10 times for some workload data, promising in leading to more reasonable waiting time and better user's satisfaction.