JP2010186347A - System, method and program for scheduling job - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide an efficient job scheduling system wherein priority order and a system load are considered. <P>SOLUTION: A job class table set with job execution multiplicity indicating the number of jobs simultaneously executable in each job class indicating execution priority of the job, a job execution management table for managing the job designated with the job class and having received an execution request, and job execution multiplicity of the whole system are made to be stored in a computer. The computer distinguishes the number of simultaneously executed jobs, selects the job having high execution priority from the execution waiting jobs registered in the job management table in a range not exceeding the job execution multiplicity of each job class and the whole system, and executes it. <P>COPYRIGHT: (C)2010,JPO&INPIT

Description

  The present invention relates to a job scheduling system, a job scheduling method, and a program that perform job scheduling in a computer system.

  Japanese Patent Application Laid-Open No. 2004-228561 discloses a job schedule method for changing the job execution multiplicity for each job input queue according to the system load status. According to the document, it is possible to improve the overall throughput and performance of the system and reduce the burden on the system administrator by dynamically changing the job execution multiplicity according to the system load.

JP-A-5-173807

  However, in the above-described job schedule method of Patent Document 1, since jobs are executed in the order of submission (submission) to the job input queue, there is a problem that urgent jobs cannot be executed preferentially. is there.

  On the other hand, with the method of executing jobs based on priority, it is necessary for the system administrator to adjust the execution multiplicity of the job in order to avoid an unexpected load on the system. .

  The present invention has been made in view of the above circumstances, and is a job scheduling system capable of efficiently selecting and executing a job in consideration of the priority of the job without placing a burden on the system administrator. Another object is to provide a job scheduling method and program.

  According to the first aspect of the present invention, means for determining the number of jobs that are simultaneously executed, and job execution multiplicity indicating the number of jobs that can be executed simultaneously for each job class indicating job execution priority A job class table in which the job class is specified, a job execution management table for managing a job for which an execution request is received by specifying the job class, and a unit for storing the job execution multiplicity of the entire system. Provided is a job scheduling system that selects and executes a job with a high execution priority within a range that does not exceed the job execution multiplicity for the entire system and each job class from among the execution waiting jobs registered in the management table. .

  According to the second aspect of the present invention, for each job class indicating a job execution priority, a job class table in which a job execution multiplicity indicating the number of jobs that can be executed simultaneously is set, and the job class is designated. A job execution management table for managing jobs that have received execution requests, a step of storing the job execution multiplicity of the entire system, a step of determining the number of jobs being executed simultaneously, and the job management table A job scheduling method comprising: selecting and executing a job having a high execution priority within a range not exceeding the job execution multiplicity for the entire system and job classes from registered execution waiting jobs. Is done.

  According to the third aspect of the present invention, a means for determining the number of jobs that are simultaneously executed, and a job execution multiplicity that indicates the number of jobs that can be executed simultaneously for each job class that indicates the job execution priority. Is registered in the job management table with reference to the job class table in which the job class is set, the job execution management table for managing the job that has received the execution request by specifying the job class, and the job execution multiplicity of the entire system. And a means for selecting and executing a job having a high execution priority within a range not exceeding the overall system and job execution multiplicity for each job class from among the waiting execution jobs. A job scheduling program is provided.

  According to the present invention, it is possible to first move a job to be prioritized while ensuring system performance. In addition, since the selection of the job to be executed is automatically performed based on the job class table and the job execution multiplicity of the entire system, no special operation is imposed on the system administrator.

It is a block diagram which shows the structure of the 1st Embodiment of this invention. It is an example of a job execution management table at a certain point. It is an example of a job class table. It is an example of setting a job execution threshold. It is a flowchart showing operation | movement of the 1st Embodiment of this invention. It is a job execution threshold value for describing a specific embodiment of the present invention. It is a job class table for demonstrating specific embodiment of this invention. It is a figure for demonstrating the transition of the job execution management table in concrete embodiment of this invention. It is a figure for demonstrating the transition of the job execution management table in concrete embodiment of this invention. It is a figure for demonstrating the transition of the job execution management table in concrete embodiment of this invention. It is a figure for demonstrating the transition of the job execution management table in concrete embodiment of this invention.

[First Embodiment]
Next, a first embodiment of the present invention will be described in detail with reference to the drawings. FIG. 1 is a block diagram showing the configuration of the first exemplary embodiment of the present invention. Referring to FIG. 1, a job scheduling program 1, a job (execution job) 2 of an individual process being executed, a dedicated program (job submission program) 3 for submitting a job, a job execution management table 4, and a job class A table 5, job execution threshold value storage means 6, and system information acquisition means 7 are shown.

  The job scheduling program 1 refers to the contents stored in the job class table 5, the job execution threshold storage unit 6 and the system information input from the system information acquisition unit 7, and waits for execution registered in the job execution management table 4. An operation that selects a job that satisfies the conditions described later from the jobs and executes it as a separate process is performed. The job scheduling program 1 is a program that is resident in the memory of the computer 100. When the job class table 5 or the job execution threshold storage unit 6 is updated, the job scheduling program 1 can be operated by applying the updated settings immediately. It is possible.

  The job submission program 3 writes execution information of a job for which a job class is designated in the job execution management table 4.

  The job execution management table 4 is a table used for managing a job for which an execution request has been received by specifying a job class. FIG. 2 is an example of the job execution management table 4 at a certain point in time. Referring to FIG. 2, the job with job identifier A set with job class “1” and the job with job identifier B set with job class “2” are registered in the job execution management table 4 and executed. It has become a state. Here, it is assumed that the job class “1” has a higher execution priority than the job class “2”.

  The job class table 5 is a table used for obtaining a job execution multiplicity indicating the number of jobs that can be executed simultaneously from the job class. FIG. 3 is an example of the job class table 5. In the example of FIG. 3, for each job class, it is possible to set execution multiplicity, priority, presence / absence of system load consideration, and presence / absence of (execution) multiplicity allowed by the job class.

  In the example of FIG. 3, the job class is not used as it is as the priority, but an appropriate priority is assigned to each job class in consideration of the calculation of the priority based on the job class distribution and other priority information. Can be set. The system load consideration indicates whether or not to consider the system load status when determining whether or not to execute the corresponding job (0 = not considered / 1 = considered). The multiplicity consideration indicates whether or not to consider the multiplicity of the entire system when determining whether or not to execute the corresponding job (0 = not considered / 1 = considered). Therefore, in the example of FIG. 3, job class 0 has the highest priority and is treated as the highest priority job that is executed regardless of the system load and the job multiplicity of the entire system.

  In the example of job class 0 in FIG. 3, system load consideration = 0 (not considered) and multiplicity consideration = 0 (not considered) are set. In the example of job class 1 and lower, system load consideration = 1 (considered) Yes), multiplicity consideration = 1 (considered) is set, but for a specific job class, either system load consideration or multiplicity consideration is set to 0 (not considered) or 1 (considered) It is also possible to do. This allows the system to be flexible.

  The job execution threshold value storage means 6 stores a system load used when determining whether or not to execute the corresponding job and a threshold value of job multiplicity of the entire system. The job execution threshold value storage means 6 can be realized by storing these threshold values in the setting file of the job scheduling program 1. FIG. 4 is an example of the job execution threshold. In the example of FIG. 4, items such as CPU load (%), load average, physical memory usage (%), virtual memory usage (%), and disk load (%) are provided as system load thresholds. The overall multiplicity indicates a threshold for job execution multiplicity of the entire system. For example, if the system load is taken into consideration and the CPU load exceeds 80%, the execution of the corresponding job is suppressed. Similarly, when (job execution) multiplicity is considered and the job execution multiplicity exceeds 15, execution of the corresponding job is suppressed.

  The system information acquisition means 7 acquires (discriminates) the system load status such as CPU load, load average, physical memory usage, virtual memory usage, disk load and the number of jobs being executed at the same time. Means for passing to the scheduling program 1. Specifically, it can be realized by a corresponding function of an OS (Operating System) installed in the computer 100 or a dedicated program.

  Next, the operation of this embodiment will be described in detail with reference to the drawings. FIG. 5 is a flowchart showing processing executed at predetermined time intervals by the job scheduling program 1.

  Referring to FIG. 5, the computer 100 checks whether a new job is registered in the job execution management table 4 (step S1).

  If a new job is registered in the job execution management table 4 (“Yes” in step S1), the computer 100 selects the job waiting for execution with the highest priority from the job execution management table 4, and sets the job class. Data of the corresponding job class is read from the table 5 (steps S2 and S3).

  If the read job class is the highest priority job class, the computer 100 immediately executes the job (“Yes” in step S4).

  When the read job class is other than the highest priority job class (“No” in step S4), the computer 100 reads out the job execution threshold value from the job execution threshold value storage unit 6 and from the system information acquisition unit 7 to the system The load status and the number of jobs executed simultaneously are acquired (step S5).

  Next, after confirming the system load consideration setting in the job class table 5, the computer 100 confirms whether or not the read system load status exceeds the threshold of each item set as the job execution threshold ( Step S6). Here, if there is an item that exceeds the threshold value of each item set as the job execution threshold value, the computer 100 returns to step S1 without executing the corresponding job (“No” in step S6).

  Next, the computer 100 confirms the multiplicity consideration setting in the job class table 5 and confirms whether or not the number of jobs being simultaneously executed exceeds the total multiplicity set in the job execution threshold. (Step S7). If the number of jobs being executed simultaneously exceeds the total multiplicity, the computer 100 returns to step S1 without executing the corresponding job (“No” in step S7).

  Next, the computer 100 confirms that no job with higher priority is registered in the job execution management table 4, and the number of jobs executed simultaneously is the execution multiplicity of the corresponding job class in the job class table 5. It is confirmed whether or not it exceeds (step S8). If a job having a higher priority is registered in the job execution management table 4 or if the number of jobs being executed simultaneously exceeds the execution multiplicity of the corresponding job class, the computer 100 Returns to step S1 without executing the corresponding job (“No” in step S8).

  If it can be confirmed in step S4 that the job class has the highest priority, and if all the job execution conditions in steps S6 to S8 are confirmed, the computer 100 classifies the corresponding job separately. The process is executed (step S9).

  As described above, according to this embodiment, it is possible to move a job to be prioritized first without increasing the burden on the system administrator. Further, according to the present embodiment, the flexibility of job operation is also improved. The reason why these effects can be obtained is to prepare a job class table that can set the priority of each job class and the execution multiplicity for each class, and automatically refer to the job class assigned to the job Is configured to determine whether or not to execute.

  In the present embodiment, since the load state of the entire system is also included in the monitoring items, the system performance can be optimized.

[Specific Embodiment 1]
Subsequently, in order to more specifically describe the operation and effect of the first embodiment of the present invention, it will be described in detail with reference to FIGS.

  FIG. 6 is another specific example of the job execution threshold. The difference from the job execution threshold value shown in FIG. 4 is that the overall multiplicity threshold value is 4 to shorten the description.

  FIG. 7 is another specific example of the job class table. The difference from the job class table shown in FIG. 3 is that 10 levels of 0 to 9 are provided as job classes, and the priority is the same as the job class.

  As shown in FIG. 8, new jobs A and B are registered in the job execution management table 4 with four jobs C, D, E, and F being registered. Shall.

  The computer 100 selects the job A having a high priority from the jobs registered in the job execution management table 4 and reads the data of the corresponding job class (0) from the job class table 5.

  Since job A is the highest priority job class (0), as shown in FIG. 9, the job A is immediately executed without considering the system load status and the execution multiplicity of the entire system.

  Next, the computer 100 selects the job B from the jobs registered in the job execution management table 4 and reads the data of the corresponding job class (3) from the job class table 5.

  Since job B is not the highest-priority job class, the computer 100 stores the job execution threshold (CPU load threshold = 80 (%), load average threshold = 4, physical memory usage threshold = 80 ( %), Virtual memory usage threshold = 80 (%), disk load threshold = 80 (%), overall multiplicity threshold = 4), and system load status is acquired from the system information acquisition means 7.

  Here, it is assumed that the system load status does not exceed the above-described job execution threshold. However, as shown in FIG. 9, the number of jobs being executed simultaneously is five (jobs C, D, E, F, and A), which exceeds the execution multiplicity threshold = 4 of the entire system. Execution is suppressed.

  Assume that jobs C and D that are being executed are completed after a predetermined time, as shown in FIG. As a result, as shown in FIG. 10, the number of jobs executed simultaneously is three, jobs E, F, and A, and the job execution conditions determined by the job execution threshold are satisfied.

  Next, the computer 100 has no job of higher priority registered in the job execution management table 4 and the number of jobs of the corresponding job class being executed simultaneously is one (job E). It is determined that the execution multiplicity of the job class (3) in the job class table 5 is not more than 2 (see FIG. 7).

  As a result, the computer 100 executes the job B as a separate process as shown in FIG.

  The preferred embodiments of the present invention and specific embodiments thereof have been described above, but the present invention is not limited to the above-described embodiments and specific embodiments, and the basic technical idea of the present invention. Further modifications, substitutions and adjustments can be made without departing from the scope of the present invention.

  For example, the order of steps S6 to S8 in the flowchart shown in FIG. 5 can be changed. Also, some of the table items illustrated in FIGS. 2 to 4 and FIGS. 6 to 11 may be omitted or added. For example, although the disk load threshold is used in the examples of FIGS. 4 and 6, other job execution conditions (thresholds) depending on the input / output state may be provided.

  Further, for example, when a plurality of new jobs of the same or adjacent job class are registered, a predetermined score is obtained using information for obtaining other priorities such as an estimated execution time of the job and a job type. Calculation may be performed to determine a job to be executed first.

DESCRIPTION OF SYMBOLS 1 Job scheduling program 2 Execution job 3 Job submission program 4 Job execution management table 5 Job class table 6 Job execution threshold storage means 7 System information acquisition means 100 Computer

Claims (8)

A means of determining the number of jobs running simultaneously;
For each job class that indicates the job execution priority, a job class table that sets a job execution multiplicity that indicates the number of jobs that can be executed simultaneously, and a job that manages the job that has received an execution request by specifying the job class Means for storing the execution management table and the job execution multiplicity of the entire system,
A job scheduling system that selects and executes a job with a high execution priority within a range that does not exceed the job execution multiplicity for the entire system and each job class from among the execution waiting jobs registered in the job management table. Furthermore, a means for monitoring the load status of the system is provided,
The job scheduling system according to claim 1, wherein when the system load is large, job execution is suppressed even when the job execution multiplicity is not exceeded.   The job scheduling system according to claim 1 or 2, wherein for each job class, it is possible to set whether or not to use job execution multiplicity for job execution determination of the job class.   4. The job scheduling system according to claim 2 or 3, wherein for each job class, it is possible to set whether or not to use a system load for determining execution of a job of the job class.   The job scheduling system according to any one of claims 2 to 4, wherein the job class table is read each time a determination is made as to whether or not to execute a job.   The job scheduling system according to any one of claims 2 to 5, wherein at least one of a CPU usage rate, a memory usage rate, a load average, and an input / output state is monitored as the load status of the system. For each job class that indicates the job execution priority, a job class table that sets a job execution multiplicity that indicates the number of jobs that can be executed simultaneously, and a job that manages the job that has received an execution request by specifying the job class Storing each of the execution management table and the job execution multiplicity of the entire system;
Determining the number of jobs running simultaneously;
Selecting and executing a job having a high execution priority within a range not exceeding the job execution multiplicity for the entire system and each job class from among the execution waiting jobs registered in the job management table. Job scheduling method. A means of determining the number of jobs running simultaneously;
For each job class that indicates the job execution priority, a job class table that sets a job execution multiplicity that indicates the number of jobs that can be executed simultaneously, and a job that manages the job that has received an execution request by specifying the job class With reference to the execution management table and the job execution multiplicity of the entire system, the job execution multiplicity of the entire system and job class is not exceeded from among the execution waiting jobs registered in the job management table. A job scheduling program for causing a computer to function as each of the means.

Images