JPH0512038A - Cpu queuing time control dispatching system - Google Patents

Abstract

PURPOSE:To secure CPU assignment by introducing the CPU queuing time as a control variable when many and unspecified jobs are supplied to a system and assignment of a CPU resource to jobs is controlled in circumstances of multi-job execution. CONSTITUTION:When plural jobs provided with various characteristics are supplied to a computer system and queuing for assignment of the CPU resource, the precedence of dispatching is changed in accordance with the queuing time of the CPU resource, and the CPU resource is assigned to jobs in the order from the job having the highest priority level. That is, in the system using only priority as a simple system, priority is set as a function 1 of the queuing time as shown in the Figure because trouble that only jobs having higher priority levels are executed occurs in the case of the existence of two jobs having high and low priority levels in the system. The CPU is assigned to a job when its priority level is higher than that of the job executed at present.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a CPU waiting time control dispatching system, and more particularly to a CP for each job during multi-job control in a computer system.
Regarding U resource allocation.

[0002]

2. Description of the Related Art Conventional dispatching methods include priority dispatching, which is controlled by giving priority to a job, and time slice dispatching, in which the CPU allocation time is determined for each job and the next job is executed when the CPU allocation time is exceeded. Ng, I / O and C
There is dynamic dispatching, which controls PU time by reflecting it in priority.

[0003]

In the conventional dispatching method described above, the priority and the characteristic of the job (for example, I / O frequency) are used as control variables for allocating CPU resources to each job. .. However, since the waiting time of each job is not taken into consideration when an unspecified number of jobs are submitted to the system, there is a drawback that a certain job may be kept waiting for a long time.

[0004]

According to the CPU latency control dispatching method of the present invention, when a plurality of jobs having various characteristics are submitted to a computer system and waiting for the allocation of the CPU resources, The priority order of dispatching is changed according to the waiting time, and the CPU resources are allocated in the order of high priority.

[0005]

DESCRIPTION OF THE PREFERRED EMBODIMENTS Next, the present invention will be described with reference to the drawings.

First, there is a simple dispatching method using only priority. In this method, when there are jobs with two high and low priorities in the system, only the job with high priority is executed. Therefore, the priority is set as a function 1 of the waiting time as shown in FIG. When the priority of the currently executed job becomes higher, the CPU is assigned to the job.

[0007]

As described above, according to the present invention, when an unspecified number of jobs are submitted to the system and the CPU resources are controlled to be allocated to the jobs under the multi-job execution environment,
By introducing a control variable called "CPU waiting time", there is an effect that CPU allocation can be guaranteed.

[Brief description of drawings]

FIG. 1 is an explanatory diagram illustrating a relationship between a CPU waiting time and a dispatching priority.

[Explanation of symbols]

 1 function

Claims (1)

1. When a plurality of jobs having miscellaneous characteristics are submitted to a computer system and waiting for CPU resource allocation, the dispatching priority order is changed according to the waiting time of the CPU resource. However, the CPU latency control dispatching method is characterized in that the CPU resources are allocated in the descending order of priority.