Mix-dependent job scheduling—An application of hybrid simulation

This is the authors' abstract. We don't add key points for this paper.

In a computer system, scheduling occurs whenever the next-task-to-receive-service is selected from a queue of waiting tasks. 5 This paper considers the scheduling of jobs which will become active; that is, which will begin to compete for use of the system processors. Jobs waiting to be activated may be scheduled by referring to properties of the job such as priority or total resource usage. 4,7 It is also possible to examine some feature of the jobs already activated (i.e., the jobs in the multiprogramming mix) in order to determine a suitable candidate for admission to the mix. This is called mix-dependent scheduling. Here, we prefer to examine some intrinsic property of the jobs rather than an external one. The property we have chosen to investigate is the rate of processor (CPU or I/O) usage.