JPH036738A - Job schedule control method - Google Patents

Abstract

PURPOSE:To prevent the increase of the number of jobs which are kept waiting for execution by increasing the number of initiators to be assigned to the job classes in accordance with the change of the actual job processing state. CONSTITUTION:Each job forms its queue in a job queue 2 at every job class, and each initiator 3 takes the jobs out of the queue 2 and starts the process of the job of the assigned job class based on the instruction given from a generalized main service GMS 4. The time elapsed from the start of execution is stored in an execution time store table 9 for each job. Then the GMS 4 compares the contents of the table 9 with those of a reference time storing table 8. When the elapsed time of a certain job exceeds the reference time of the due class of the job, the number of initiators is increased to the job class. Thus it is possible to prevent the number of jobs which are kept waiting for execution and also to prevent the lowering of the computer efficiency.

Description

[Detailed Description of the Invention] [Field of Industrial Application] The present invention relates to job scheduling in a computer system, and particularly to job execution turnaround and
Related to job scheduling automation to prevent time deterioration.

[Conventional technology]

In conventional job scheduling, job processing management information is prepared in advance for each job class, specifying the allocated time slot, number of jobs that can be executed in parallel, priority, etc., and when this information is given to a computer by an operator, , that information is retained and changes require operator intervention. Also, JP-A-60-
As described in Japanese Patent No. 27949, a job scheduling system has also been proposed in which multiple sets of job processing management information are provided and the operating system selectively uses them, thereby improving the operational efficiency of the computer system. Although it is.

All such job processing management information sets must be prepared by the operator.

[Problem to be solved by the invention]

The number of initiators is created based on the prediction of jobs to be submitted to a computer, but the execution time of the actually submitted jobs varies greatly depending on the nature of the program.

Therefore, the number of initiators is calculated based on the average job execution time.

However, among the jobs processed in an actual computer system, there are jobs such as debug jobs that take a very long execution time due to factors such as program error. If such a job occupies an initiator for a long time, the job execution queue becomes large and the processing efficiency of the computer decreases. If such a problem occurs,
It is necessary to change job processing management information (number of initiators), but with the above conventional technology, operator intervention is required for this change, making it impossible to respond quickly and accurately, making it difficult to determine the optimal job schedule. There was a problem in that it was difficult to maintain it all the time.

An object of the present invention is to provide a job schedule control method for controlling the number of initiators so as to prevent an increase in the number of jobs waiting for execution due to initiators being occupied by long-term jobs.

[Means to solve the problem]

The above purpose is to provide a computer system that classifies successively submitted jobs into job classes and operates multiple initiators that control job execution according to a job execution schedule that determines the number of job classes to be executed and the priority of execution. A means for measuring the elapsed time from the start of execution for each job being executed, and a means for storing a preset reference execution time for each job class are provided, and the elapsed time from the start of execution for a certain job being executed is provided. If the time exceeds the standard execution time for the job class to which the job belongs, add and allocate an initiator to the job class to which the job belongs.1. This is achieved by restoring the original number of initiators at the end of the job.

[Effect]

The preset standard execution time indicates the standard job execution time for each job class, and a job that is executed beyond this time will delay the execution of other jobs submitted to the same job class. There is a fear. By increasing the number of initiators for a job class in such a state, it is possible to prevent an increase in the number of jobs waiting to be executed and to prevent a decrease in computer efficiency.

Further, by not extracting the job from the initiator used by the job after the execution of the job that exceeded the standard execution time, it is possible to prevent the number of initiators from increasing more than necessary.

〔Example〕

An embodiment of the present invention will be described below in detail with reference to the drawings.

FIG. 1 shows, in the form of a functional block diagram, a computer system that executes job scheduling according to the present invention. In the figure, wide arrows indicate the flow of job processing, and single-line arrows indicate the flow of control information.

The job input unit 1 receives successive jobs input into the computer system 10, classifies them by job class, and registers them in the job queue 2. Within the job queue 2, jobs form queues for each job class.

A suitable number of initiators 3 are provided, and each initiator takes out a job from the job queue 2 and sets its execution environment. GMS
Mα-in 5service) 4 instructs the available initiators 3 from which job class queue the job should be taken out. The job execution unit 5 executes the job retrieved by the initiator 3 under a set environment, and the job output unit 6 performs output processing for the job that has finished execution.

As shown in FIG. 2, the reference time storage table 8 stores reference execution times for each job class. This table is created at system startup, but can be updated by the operator at any time.

The execution time storage table 9 stores the elapsed time from the start of execution for each job being executed by the job execution unit 5. Jobs being executed occupy the initiators assigned to them until the end of execution. Therefore, in FIG. 3, the elapsed time of the corresponding job is stored for each initiator.

As shown in FIG. 4, the initiator number Ig management table 7 stores the initial value, current value, and maximum value of the allocated initiator number for each job class. The initial value is 1
The current value, which represents the number of initiators assigned to each job class when jobs are normally processed, is:
Represents the number of initiators at a certain point in time while the computer is running.

The maximum value represents the maximum number of initiators that can be allocated to each job class.

The OMS 4 optimizes the job schedule by comparing the contents of the reference time storage table 8 and the execution time storage table 9 in accordance with the procedure described later.

FIG. 5 shows, in the form of a flowchart, an example of the job scheduling process performed in the computer system shown in FIG.

When starting up the system (step 101), the initiator number management table 7 and the reference time storage table 8 are initialized (step 102).The initiator 3 processes jobs in the assigned job class according to the instructions from the 0MS4. Start (step 103). The job taken out from the job queue 2 by the initiator is executed by the job execution unit 5.

When a certain period of time has elapsed while job processing in the computer is being repeated (step 1.4), the elapsed time from the start of execution for each job being executed is stored in the execution time storage table 9. (Step 1o5)
. The 0MS4 compares the contents of this table with the contents of the reference time storage table 8, and if the elapsed time of a certain job exceeds the reference time of the job class that transfers to that job (step 106) - On the other hand, if it is possible to add an initiator (step 1.7), one initiator is added and assigned to the job class, and job processing is started (step 108). To check whether it is possible to add more initiators, actually:
This is done using the initiator number management table 7, and if the current value of the number of initiators on the table is less than the maximum value, expansion is possible and the current value on the table is updated by +1. However, if an initiator has already been added to the job, the initiator will not be added. If expansion is not possible, the number of initiators will remain as is.

The above process is repeated until there is a job that has completed execution (step 109).

If there is a job that has finished executing, the 0MS4 checks whether an initiator has been added for the execution of that job (
This confirmation is made by checking whether the initial value and current value of the number of initiators in the initiator number management table 7 are different (step 110). If the current value is larger than the initial value, the 0MS4 stops issuing job retrieval instructions to the initiators that become vacant due to the completion of job execution that triggered the addition of initiators, and updates the current value on the initiator number management table 7. By updating the value to -1, the number of initiators for the job class is reduced by one (step 111). If no initiators have been added to the job that has completed execution, 0MS4 is the number of vacant initiators. Instructs to retrieve the next job and executes it (step 11:11')
.

The above process is repeated until the computer is instructed to stop (steps 113, 114).

According to this embodiment, even if a job with a long execution time occurs, job scheduling is achieved that automatically prevents a decrease in computer processing efficiency.

Furthermore, by setting the maximum value in the initiator number management table 7, job scheduling can be maintained in accordance with the characteristics of each job class, the system resource situation, and the operation policy of the computer center. However, if the number of initiators is unlikely to increase dramatically, such as when the occurrence rate of jobs with long execution times is low, the initiator number management table 7 can be eliminated, and the occurrence of long-running jobs
It is also possible to always increase the number of initiators, and then reduce the number of initiators after the long-time job execution ends.

〔Effect of the invention〕

According to the present invention, the assignment of initiators to job classes is automatically optimized in accordance with changes in actual job processing conditions. As a result, even if some of the jobs being executed in the computer have a very long execution time, increasing the number of initiators can prevent an increase in the number of jobs waiting for execution. Therefore, the operational efficiency of the computer system can be automatically maintained at the optimum level at all times.

[Brief explanation of the drawing]

FIG. 1 is a functional block diagram showing an example of a computer system that executes the job schedule control method of the present invention;
The figure shows an example of the contents of the reference time storage table.
The figure shows an example of the contents of the execution time storage table.
The figure shows an example of an initiator number management table, and FIG. 5 is a flowchart of an embodiment of the job schedule control method of the present invention. 2... Job queue 3... Initiator, 4... GMS, 5... Job execution unit, 7... Initiator number management table, 8... Reference time storage table. 9...Execution time storage table, 104-108...Initiator 1g! Setting process, 11
0 to 111...Initiator reduction processing. Akira 2nd Akira 4th mouth

Claims (1)

[Claims] 1. In a computer system that classifies successively submitted jobs into job classes and operates multiple initiators that control job execution according to a job execution schedule that determines the number of job classes to be executed and the priority of execution. A means for measuring the elapsed time from the start of execution for each job, and a means for storing a preset reference execution time for each job class are provided, and the elapsed time from the start of execution for a certain job being executed is provided. If the above-mentioned standard execution time for the job class to which the job belongs is exceeded, initiators are added and assigned to the job class to which the job belongs, and the allocation of the number of initiators is returned to the original number when the job ends. , Job schedule control method.