FCFS: a novel scheduling policy for tightly-coupled parallel computer systems
Jerry Place · 1989
Tightly-coupled parallel computer systems are available from several vendors. The mechanism for process scheduling employed by virtually all of these systems is preemptive by job priority. This scheme for process scheduling consumes significant processor resources and can result in significant processor contention for the scheduling data structure. In this paper we show that it is possible to reduce the number of job priorities, and at the same time reduce the administrative overhead on the system, without significantly increasing job wait time. Also we show, by four simulation studies, that non-preemptive scheduling mechanisms are just as effective as preemptive techniques when coupled with time slice control and multiprogramming limits. Thus simplified scheduling techniques that require little overhead to prevent processor contention may be employed in a tightly coupled parallel environment without sacrificing either mean response time or the s of response time.