JPH02158841A - Effectively using system for idle cpu - Google Patents

Abstract

PURPOSE:To execute a batch job by using the time of an idle CPU without exercising influence upon other batch job by giving the decision value of the idle condition of the CPU to a low precedence job executing means. CONSTITUTION:In the case where it is desired to execute the batch job by using the time of the idle CPU without exercising influence upon other batch job, the batch job is set by taking characteristics such as the use time of the CPU by the other batch job, the used quantity of a memory and the quantity of use time of input/output into consideration as the dynamic decision value and the static decision value of the idle condition of the CPU. Thus, the idle condition of the CPU extending over the various classes of a schedule can be decided, and it becomes possible to execute the batch job by using the time of the idle CPU without exercising influence upon other batch job. Besides, even in the case where the batch job to take several days is executed in computer system whose working time is fixed, it is execute by using the time of the idle CPU without being conscious of these at all.

Description

[Detailed Description of the Invention] [Industrial Application Field] The method of effectively utilizing a vacant CPU of the present invention is a computer system in which the operating hours per day are fixed, and batch jobs that require several days to be processed are transferred to other computers. The present invention relates to a method for effectively utilizing free CPU to execute batch jobs without affecting them.

[Conventional technology]

In a computer system that processes batch jobs, in a computer system where the operating time of the computer system per day is fixed, batch jobs that require several days to be processed must be processed so that the CPU is free so as not to affect other batch jobs. To run by time, set the priority of this batch job lower than other jobs, and when the computer system finishes running, interrupt the execution of this batch job, output the memory contents to disk, and start the next run of the computer system. After starting, the programmer or computer system operator had to consciously carry out the process of loading the program from disk to memory and restarting execution.

[Problem to be solved by the invention]

In the method of lowering the priority of the conventional technology described above,
Executing a batch job that requires several days to process, which either executes or stops, and which cannot be precisely controlled by considering other batch jobs' characteristics such as computer system resource usage and urgency. When the computer system finishes running, the programmer or computer system operator must consciously interrupt the execution of this batch job.
Outputs memory contents to disk. Then, when the computer system starts operating, the programmer or computer system operator must consciously load the data from the disk to the memory and restart the execution of this batch job. Therefore, batch jobs that require several days to process have the disadvantage that they cannot be performed automatically without being aware of the above-mentioned operations.

[Means for Solving the Problems] The method of effectively utilizing a free CPU of the present invention is to periodically check the CPU load status and check the CPU free condition during the execution of a batch job that requires several days to process. It is determined whether or not the free space condition is satisfied, and if the free space condition is satisfied, the batch job is continued to be executed, and if the free space condition is not satisfied, the execution is interrupted and the memory of this batch job is a low-priority job execution means that outputs the content to a disk external storage device and, if the free space condition is not satisfied, loads the job from the external storage device to main memory and resumes execution; At the time of termination, job termination means interrupts the execution of the batch job and outputs the main memory contents to disk, and at a specified time or when the computer system starts operating, the job termination means loads the contents of the batch job from the external storage device to the main memory. and job starting means for restarting execution.

〔Example〕

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

FIGS. 1(a) to 1(c) are flowcharts showing the configuration of an embodiment of the present invention, and FIG. 2 is a chart explaining an example of a method for determining CPU availability conditions used in the present invention.

This embodiment includes a low priority job execution means 1 shown in FIG. 1(a), a job termination means 2 shown in FIG. 1(b), and a job start means 3 shown in FIG. 1(C). ing.

First, the low priority job execution means 1 of the present invention will be explained based on FIG. 1(a).

A batch job that requires several days to process without affecting other batch jobs is set as a low-priority job, and when this low-priority job is executed on a computer system, the CPU load status is checked and CPU free space is checked. It is determined whether the conditions are satisfied (step 1-1). If the CPU availability condition is satisfied, the processing of the low priority job is continued (step 1-2). ), after a certain period of time, it is determined whether the low-priority job has finished or not (steps 1-3), and if it has not finished, repeat step 1
It is determined whether the CPtJ availability condition shown in -1 is satisfied.

At this time, if the CPU free space condition is not satisfied, the contents of the main memory will be output to an external storage device such as a magnetic disk (Step 1-4), the execution of the low priority job will be interrupted, and the low priority job will be suspended. Stop the job (Step 1-
5). Then, after a certain period of time, it is determined whether the CPU availability condition is satisfied (step 1-6).
If the CPU availability condition is not satisfied, the low-priority job continues to be stopped (step 1-5), and if the CPU availability condition is satisfied, the job is loaded from the external storage device to the main memory (step 1-5). 7) Processing is restarted by executing the low priority job (step 1-2). After performing this series of processing, it is determined whether or not the low priority job in step 1-3 has been completed, and if it has been completed, this processing is over.

Here, while the series of processes shown in FIG. 1(a) is being controlled, when the specified time to end this control or the end of operation of the computer system is reached, the job ending means shown in FIG. 1(b) is executed. When the end time is determined by the control in step 2 (
Step 2-1) Output the contents of the main memory to an external processing device, and execute the low-priority job unless the execution is interrupted due to the stop of the low-priority job (Step 2-3) or when the computer system has finished operating. Means 1 is executed.

Furthermore, when the specified time to start processing or the start time of the computer system comes, if the start time is determined by the control of the job starting means 3 shown in FIG. 1(c) (step 3-1), the job is stored first. The content of the external processing device that has been stored will now be loaded into the main memory (step 3-2). The execution of the low-priority job is resumed (step 3-3>, and the low-priority job execution means 1 shown in FIG. 1(a) is executed.

The conditions for determining whether the CPU availability conditions in steps 1-1 and 1-6 in Figure 1' are satisfied include dynamic determination, static determination, and mixed determination by combining both. As shown in the diagram, class A is the schedule class.
If there are class B, class C, and low priority job class L, the number of executions of each class at the time of judgment is i
'l @ g n bl n 6. In this case, the dynamic determination uses the weight value of the executed job as the dynamic determination value m.

mb, m, if the maximum value of the binding execution job weight is set as m@@X, nu Xm, +nb xmb+na Xmo <mma
This is done depending on whether the conditional expression of x is satisfied. In addition, for static judgment, the allowable number of executions is N1°Nb, N, as a static judgment value.
If the maximum allowable execution and the number of cases are set to N 1mmk, then n1≦N1 and nb≦Nb and no≦N.

The determination is made based on whether or not the conditional expression n, +nb+no≦N@ax is satisfied. Furthermore, it is also possible to perform a mixed determination by combining the two.

Therefore, in this embodiment, if you want to execute a batch job using free CPU time without affecting other batch jobs, you can set other values to the dynamic judgment value and static judgment value of the CPU free condition. Amount of CPU usage time for batch jobs,
By considering characteristics such as memory usage and input/output time usage, you can determine the CPU free conditions that span classes in the schedule, and calculate the free CPU time without affecting other batch jobs. It can be executed using .

In addition, in computer systems whose operating hours are fixed,
Even when executing a batch job that requires several days, it is possible to execute it using available CPU time without being aware of it.

〔Effect of the invention〕

As explained above, in the present invention, when it is desired to execute a batch job using free CPU time without affecting other batch jobs, the judgment value of the CPU free condition is set to a low priority job execution means. By giving a batch job to , it is possible to execute the job using vacant CPU time without affecting other batch jobs.

Furthermore, when there is a limit on the operating time of the computer system, even if a batch job is executed beyond the limit, it is possible to execute the batch job using the available CPU time without any conscious effort.

This makes it possible to effectively utilize the vacant CPU without any increase in the burden on the programmer or the operator of the computer system.

[Brief explanation of the drawing]

1A to 1C are flowcharts showing the configuration of an embodiment of the present invention, and FIG. 2 is an explanatory diagram showing an example of a method for determining CPU availability conditions used in the present invention. 1...Low priority job execution means, 2...Job termination means, 3...Job start means.

Claims (1)

[Scope of Claims] During the execution of a batch job that requires several days to process, the load status of the CPU is periodically checked and it is determined whether the CPU availability condition is satisfied, and the CPU availability condition is determined. If the above-mentioned free space condition is satisfied, the batch job is continued to be executed, and if the free space condition is not satisfied, the execution is interrupted, the memory contents of this batch job are output to a disk external storage device, and the free space condition is satisfied. a low-priority job execution unit that loads the batch job from the external storage device into the main memory and resumes execution if the state is not satisfactory; A job finishing means outputs the contents to a disk, and a job starting means loads the content from the external storage device to the main memory and resumes execution of the batch job at a specified time or when the computer system starts operating. Featured vacancy C
Effective use method of PU.