A Dynamic Job Scheduling Algorithm for Parallel System
Jian Zhang, 陆鑫达, 加力 · 上海交通大学学报：英文版 · 2003
One of the fundamental problems in parallel and distributed systems is deciding how to allocate jobs toprocessors. The goals of job scheduling in a parallel environment are to minimize the parallel execution time of ajob and try to balance the user's desire with the system's desire. The users always want their jobs be completed asquickly as possible, while the system wants to service as many jobs as possible. In this paper, a dynamic job-scheduling algorithm was introduced. This algorithm tries to utilize the information of a practical system to allo-cate the jobs more evenly. The communication time between the processor and scheduler is overlapped with thecomputation time of the processor. So the communication overhead can be little. The principle of scheduling thejob is based on the desirability of each processor. The scheduler would not allocate a new job to a processor that isalready fully utilized. The execution efficiency of the system will be increased. This algorithm also can be reused inother complex algorithms.