The impact of scheduling gangs with the shortest execution time on gang scheduling performance

摘要

Gang scheduling is an efficient scheduling approach that combines elements of space-sharing and timesharing. The FillMatrix is the fourth phase in GS and plays the main role in accelerating the scheduling of more gangs. In this paper, a novel method is proposed to fill the matrix by a gang that has the smallest execution time (SET). By this method, this gang will be executed faster, and therefore more space of matrix will be freed to scheduling more larger gangs. The performance of the proposed algorithm is evaluated under different workload variability cases. The simulation results reveal the achievement improvement of SET-FillMatrix, especially in lighten workloads.