JPH0833830B2 - Schedule device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Industrial field of use] The present invention relates to a scheduling device for scheduling simultaneous use of resources in an electronic computer system.

[Conventional technology]

Conventionally, in this type of scheduling device, as a scheduling method, FCFS (First
Come First Service) or SPT (Shortest Processing Tim)
e) The method called the method was adopted.

[Problems to be Solved by the Invention]

However, the conventional scheduling device described above,
When the FCFS method was adopted, the total waiting time for all jobs was large and the throughput decreased compared to the SPT method. On the other hand, the SPT method itself has good throughput, but requests with a long expected processing time are often used by other jobs for the target resource, and in a high load environment where there is no interruption in waiting, it is always postponed. There was a drawback that it was done.

The present invention has improved such a conventional drawback, and an object thereof is to improve the system performance by improving the throughput and preventing a situation in which a request with a long expected processing time is always postponed. It is to provide a schedule device capable of

[Means for solving the problem]

The scheduling apparatus of the present invention receives a usage request for a resource from a plurality of jobs and performs scheduling, and when the number of waiting jobs at the present time of the usage request for the resource is equal to or more than a specified number, the specified number of jobs A rearranging unit that rearranges the waiting order of the first waiting request in ascending order of resource usage scheduled time is arranged such that the request waiting process that has once undergone the rearranging process is excluded from the rearrangement target thereafter. It is characterized by being.

[Action]

The scheduling device accepts usage requests for resources from a plurality of jobs and performs scheduling. At this time, when the number of waiting jobs at the present time of the usage request for the resource is equal to or more than the specified number, the sorting means sorts the waiting order of the specified number of head waiting requests in the order of the shortest scheduled resource usage time. This can improve the throughput. Further, since the rearrangement means does not rearrange the waiting for a request which has been subjected to the rearrangement processing thereafter, it is possible to prevent a request having a long expected processing time from being always put off.

〔Example〕

 Next, the present invention will be described with reference to the drawings.

FIG. 1 is an environment diagram of a scheduling apparatus according to the present invention, in which a usage order of usage jobs Ji-1 to Ji-n using a resource i is performed via a scheduling apparatus SUi provided corresponding to the resource i. It is shown that it is decided by.

The scheduling device SUi of this embodiment is provided with a scheduling section SPi of a scheduling method as described later.

FIG. 2 is a diagram showing an example of the configuration of the schedule unit SPi. The schedule unit SPi includes a request reception unit RQi, a user determination unit DFi, a waiting order rearrangement unit CQi, and a use end notification reception unit TMi. It consists of and.

Next, the operation of the schedule device having such a configuration will be described with reference to the flowcharts of FIGS. Note that FIG. 3 is a flowchart showing the processing flow of the request receiving unit RQi and the use end notification receiving unit TMi, and FIG. 4 is a flowchart showing the processing flow of the waiting order rearranging unit CQi.
FIG. 5 is a flowchart showing the processing flow of the user determination unit DFi.

First, in step S1 in FIG. 3, the request receiving unit RQi registers a job in the waiting queue as a process of receiving a request to use the resource i from each of the jobs Ji-1 to Ji-n. At this time, the scheduled resource use time is also attached as a request attribute of the job. For example, for peripheral device resources such as a drum and an electronic disk, the i / o transfer size is used as the scheduled resource usage time.

Next, in step S2, the use end notification receiving unit TMi receives the notification that the usage status of the job with the resource i has been released and the resource can be used for the next request, and in step S3 the next used job is determined. To get it done
Upon receiving the notification, the user determination unit DFi is activated.

The user determination unit DFi is activated by the use end notification reception unit TMi when the resource i is available and free,
The process of FIG. 5 for determining the next job to be used is performed. That is, in step S4 of FIG. 5, it is determined whether there is a wait,
When there is a wait, in step S5 the waiting order rearranging unit CQi
Is called, and the first 1 in the waiting queue in step S6
The individual is taken out of the waiting state and defined as a job to use the resource i.

In the conventional FCFS scheduling method, the waiting order rearranging unit CQi was not called.

The waiting order rearrangement unit CQi is the most important component of the present invention and performs the processing shown in FIG. That is, in step S10 of FIG. 4, it is determined whether or not the waiting head is rearranged, and if not, the number of waiting queues is determined at the operation level in step S11 and the specified number Qi is specified.
If it is more than the specified number Qi, the processing order of the Qi pieces is rearranged in ascending order of the scheduled usage time of the resource i in step S12, and a mark indicating that the rearrangement has been performed is executed in step S13. Wait for these Qi pieces.
As a result, the order of waiting for the rearrangement processing is not changed until execution.

In this way, when deciding the next job to be used when the resource i is free, the Qi processing order is rearranged in the ascending order of the scheduled use time of the resource i, so that the throughput can be improved, Furthermore, once the processing order has been rearranged, the order is not changed until execution, so it is possible to prevent a request with a long processing expected time from being always postponed.

Figure 6 shows that the usage request from 10 jobs to the same resource is 30ms.
Regarding the relationship between the time-series processing order and the total waiting time in the case of each ec, the difference between the FCFS (First Come First Service) method, the SPT (Shortest Processing Time) method, and the method of the present invention is illustrated. Is. As can be seen from FIG. 6, according to the present invention, the average waiting time is 50 ms and the maximum waiting time is 90 ms, so that the waiting time can be reduced as compared with the conventional method.

〔The invention's effect〕

As described above, according to the present invention, the processing requests are rearranged to prioritize the one having the shortest resource usage time once, so that the total waiting time of the system is reduced to improve the throughput and the processing is performed once. Since the changed processing request is excluded from the rearrangement thereafter,
There is an effect that the system performance can be improved by avoiding the situation that the one that is used for a long time is easily treated cold.

[Brief description of drawings]

FIG. 1 is an environment diagram of a schedule device according to the present invention, and FIG.
FIG. 1 is a block diagram of the schedule unit of the schedule device shown in FIG. 1, FIG. 3 is a flowchart showing the processing flow of the request receiving unit, use completion notification receiving unit, and FIG. 4 is a flowchart showing the processing flow of the waiting order rearranging unit. 5 is a flow chart showing the processing flow of the user determination unit, and FIG. 6 is a conventional FCFS.
FIG. 6 is a diagram for explaining a comparison of waiting times between the system, the SPT system and the system of the present invention. In the figure, i ... resources, Ji-1 to Ji-n ... use request jobs for resource i, SUi ... schedule device for resource i, S
Pi ... Schedule, RQi ... Request receiving, TMi ... Use end notification receiving, DFi ... User determining, CQi ... Waiting order rearranging.

Claims (1)

[Claims] 1. A scheduling device that receives a usage request for a resource from a plurality of jobs and performs scheduling, when the number of waiting jobs at the present time of the usage request for the resource is equal to or more than a specified number, the waiting request for the specified number of heads is requested. Has a rearranging means for rearranging the waiting order of the resources in ascending order of resource usage time, and the rearranging means excludes the waiting for a request that has once undergone the rearranging processing from the rearrangement target thereafter. Characteristic schedule device.