Effects of job size irregularity on the dynamic resource scheduling of a 2-D mesh multicomputer

Abstract

Irregularities of the shapes and sizes of jobs are important factors affecting the performance of a resource scheduling algorithm in a 2-D mesh multicomputer. We examine the performance effect of irregularity, by examining a dynamic scheduling system that schedules jobs with requests that range from regular-shaped partitions of a multicomputer to irregular-shaped partitions. In order to evaluate the effect of irregularity, we examine a job scheduling algorithm called the BWQ-search algorithm, which uses multiple queues for ordering jobs to be placed on a 2-D mesh multicomputer. We find that the performance is similar when the system schedules jobs that request various types of irregular-shaped partitions. A large improvement in performance occurs if all jobs scheduled on the multicomputer request very regular-shaped partitions.