JP7014010B2 - Job execution management system and job execution management method - Google Patents

Description

The present invention relates to a job execution management system and a job execution management method.

In the field of operation management, a job execution management system that manages job execution is known. A job is a processing procedure defined for a certain purpose such as business. A job is, for example, a single or continuous program described in a shell script in UNIX® or a batch script in Windows®. The job execution management system includes a job network indicating the execution order of one or more jobs and a group of programs for processing the batch job.

The job execution management system is generally a system in which a manager device manages job definition information and controls the flow of a job network, and causes an agent device to execute an actual job.

When executing a job, resources such as CPU (Central Processing Unit), memory, and disk device are consumed. Therefore, the number of jobs that can be executed at the same time is limited, and the number of executions is limited so that the load on the resources is not applied. Has been done. Queues are often used to limit the number of executions. A queue is a so-called queue, and is a mechanism for controlling the execution wait state that occurs when the job execution input speed and the execution completion speed are different. For example, when a job requested by a manager device is executed on an agent device, if another job is already executed on the agent device, multiple jobs will be executed at the same time, which is resource-intensive. There is a risk. Therefore, the execution number limit limits the number of jobs that may be executed at the same time, waits in a queue, and executes the jobs when the turn comes, thereby preventing resource depletion.

However, there are not only resources that can be shared by a plurality of jobs such as CPU and memory, but also resources that cannot be shared, in other words, resources that are occupied by any of the jobs (hereinafter referred to as "exclusive resources"). Exclusive resources are, for example, the transmission of huge data itself in the data transmission process to a printer in the print process, a backup destination area or tape device in the data backup process, or a server in another geographically distant data center. Is. Regarding the transmission of huge data, the network communication itself can be shared, but since the transmission of huge data substantially occupies the network during the transmission period, the transmission of huge data is exclusive. It can be regarded as a resource. In addition, depending on the requirements of the application used in the job, it may be necessary to use exclusive resources.

Patent Document 1 describes a technique for optimizing execution scheduling based on a margin time when performing execution order control between tasks. The spare time means that when task C, whose shared resource occupancy time is known, occupies a resource shared with task A whose scheduled execution start time is fixed, task C releases the resource and then task A executes it. It shows the time allowance until the start.

Japanese Patent Application Laid-Open No. 2003-131892

If jobs that use the same exclusive resource try to run at the same time, a conflict will occur and one of the jobs will have to wait. Since such a meeting becomes a processing bottleneck, it leads to an increase in the processing time of the entire flow of the job network. Therefore, the job execution management system needs lock control so that the job can lock and use the exclusive resource.

It should be noted that all the lock controls described below are "exclusive locks that can be waited for". If the exclusive resource for which the lock is requested has already been locked by another person, instead of rejecting it, the lock is placed in a waiting state and locked when the turn comes. In addition, there are further types of locks, "shared lock" and "exclusive lock", but here, "exclusive lock" is targeted. Therefore, the "exclusive lock that can be met" is targeted.

Examples of the existing lock control include the following first to third methods.

The first method is, for example, a method of acquiring a lock when an agent device is requested to execute a certain job and the job is queued, that is, when the job has not been executed yet. In the case of the first method, the lock can be acquired while waiting in the queue, so it is possible to immediately start the execution of the job by using the exclusive resource when the job execution order comes around. can. On the other hand, in the case of the first method, the exclusive resource is locked before the turn comes, so if it takes a long time to execute the previously queued job, it exists in another queue. Jobs that want to use the same exclusive resource that can be executed immediately will be in a lock wait state.

Contrary to the first method, the second method is a method of waiting in a queue and locking the necessary exclusive resources after the queue is free and the job can be executed. In the second method, the lock waiting state unlike the first method does not occur. However, if the lock cannot be acquired immediately and the job is waited for, the job does not start execution immediately. Moreover, since the job is already in the execution state, the limit frame for the number of executions of the corresponding queue is wasted. That is, in the case of the second method, the existence of a job waiting for a lock but not being executed may hinder the execution of subsequent jobs in the queue.

On the other hand, the third method is a method of locking when the execution order has come. Specifically, in the third method, when the job desired to be locked cannot be locked immediately, the subsequent job is executed first with the lock requested, and the job is executed in the "next execution order" in the queue. It is a method to keep the "position where the wheel turns". In the third method, the above process is repeatedly executed until the lock can be acquired. In the case of the third method, if the lock cannot be performed immediately and the lock is waited for, the execution order is handed over to the succeeding job, so that the execution of all the succeeding jobs is not hindered. That is, the third method eliminates the demerits of the second method. However, in the case of the third method, the succeeding job is executed first while the lock is acquired. Therefore, if the previously executed job is a job that has been executed for a long time, the first job is performed accordingly. There is a risk that the same disadvantages of the method (that is, waiting for lock) will occur.

As described above, the existing lock controls have different timings for locking the exclusive resources, but they all have some problems, and it is hard to say that they are the optimum methods.

In Patent Document 1, it is premised that the task is "interruptable", but the job using the exclusive resource may not be interruptable. Therefore, the technique of Patent Document 1 cannot be directly applied to the job execution management system that manages jobs as described above.

The present invention has been made to solve the above problems, and even when there are a plurality of jobs that use the exclusive resource, the execution time of the entire job network is further reduced by avoiding the lock waiting of the exclusive resource as much as possible. The purpose is to provide technology that can be shortened.

The job execution management system of the present invention includes a manager device for managing jobs and one or more agent devices for executing the job, and the manager device is all queued in the queue of the agent device. From the jobs, the job that can start the use of the exclusive resource earliest after the lock of the exclusive resource is released is specified and preferentially executed, and the agent device uses the exclusive resource. When a job reaches the execution order in the queue without being preferentially executed, the execution position of the job is retained at the position where the job is executed next when the queue becomes free, and the subsequent job is first executed. Let it run.

The job execution management method of the present invention is a job execution management system including a manager device for managing jobs and one or more agent devices for executing the job, and the manager device is placed in a queue of the agent device. From all the queued jobs, the job that can start the use of the exclusive resource earliest after the lock of the exclusive resource is released is specified and preferentially executed, and the agent device sets the agent device. When the job using the exclusive resource reaches the execution order in the queue without being preferentially executed, the execution position of the job is retained at the position where the job is executed next when the queue becomes free. It is characterized in that the subsequent job is executed first.

According to the present invention, even when there are a plurality of jobs that use the exclusive resource, it is possible to avoid waiting for the lock of the exclusive resource as much as possible and shorten the execution time of the entire job network.

It is a block diagram which shows the configuration example of the job execution management system which concerns on 1st Embodiment of this invention. It is a flowchart which shows the operation example (job execution management method) of the job execution management system shown in FIG. It is a block diagram which shows the configuration example of the job execution management system which concerns on 2nd Embodiment of this invention. It is a figure which imaged the 1st control (priority execution) executed by the job execution management system shown in FIG. It is a flowchart which shows an example of 1st control. It is a flowchart which shows an example of the 2nd control. It is the 1st figure which shows the queue state for demonstrating the specific example of the priority control executed in 1st Embodiment. FIG. 2 is a second diagram showing a queue state for explaining a specific example of priority control executed in the first embodiment. FIG. 3 is a third diagram showing a queue state for explaining a specific example of priority control executed in the first embodiment. FIG. 4 is a fourth diagram showing a queue state for explaining a specific example of priority control executed in the first embodiment. FIG. 5 is a fifth diagram showing a queue state for explaining a specific example of priority control executed in the first embodiment. FIG. 6 is a sixth diagram showing a queue state for explaining a specific example of priority control executed in the first embodiment. FIG. 7 is a diagram showing a queue state for explaining a specific example of priority control executed in the first embodiment. FIG. 8 is a diagram showing a queue state for explaining a specific example of priority control executed in the first embodiment. FIG. 9 is a ninth diagram showing a queue state for explaining a specific example of priority control executed in the first embodiment. FIG. 10 is a diagram showing a queue state for explaining a specific example of priority control executed in the first embodiment. FIG. 11 is a diagram showing a queue state for explaining a specific example of priority control executed in the first embodiment. It is a twelfth figure which shows the queue state for demonstrating the specific example of the priority control executed in 1st Embodiment. FIG. 13 is a thirteenth diagram showing a queue state for explaining a specific example of priority control executed in the first embodiment. FIG. 14 is a 14th diagram showing a queue state for explaining a specific example of priority control executed in the first embodiment. FIG. 15 is a diagram showing a queue state for explaining a specific example of priority control executed in the first embodiment. FIG. 16 is a 16th diagram showing a queue state for explaining a specific example of priority control executed in the first embodiment. FIG. 17 is a diagram showing a queue state for explaining an operation when a job is executed by a method (third method) of a related technique to which the present invention is not applied. FIG. 18 is a diagram showing a queue state for explaining an operation when a job is executed by a method (third method) of a related technique to which the present invention is not applied. FIG. 19 is a diagram showing a queue state for explaining an operation when a job is executed by a method (third method) of a related technique to which the present invention is not applied. FIG. 20 is a diagram showing a queue state for explaining an operation when a job is executed by a method (third method) of a related technique to which the present invention is not applied. FIG. 21 is a diagram showing a queue state for explaining an operation when a job is executed by a method (third method) of a related technique to which the present invention is not applied. FIG. 22 is a 22nd diagram showing a queue state for explaining an operation when a job is executed by a method (third method) of a related technique to which the present invention is not applied. FIG. 23 is a diagram showing a queue state for explaining an operation when a job is executed by a method (third method) of a related technique to which the present invention is not applied. FIG. 24 is a diagram showing a queue state for explaining an operation when a job is executed by a method (third method) of a related technique to which the present invention is not applied. FIG. 25 is a diagram showing a queue state for explaining an operation when a job is executed by a method (third method) of a related technique to which the present invention is not applied. FIG. 26 is a diagram showing a queue state for explaining an operation when a job is executed by a method (third method) of a related technique to which the present invention is not applied.

[First Embodiment]
(Explanation of configuration)
FIG. 1 is a block diagram showing a configuration example of the job execution management system 100 according to the first embodiment of the present invention.

The job execution management system 100 includes a manager device 102 that manages the job, and one or more agent devices 104 that execute the job.

The manager device 102 identifies and gives priority to a job that can start using the exclusive resource earliest after the lock of the exclusive resource is released from all the jobs queued in the agent device 104. Let it run.

When the job that uses the exclusive resource is not preferentially executed and the execution order is reached in the queue, the agent device 104 keeps the execution position of the job at the position where the job is executed next when the queue becomes free. The subsequent job is executed first.
(Explanation of operation)
FIG. 2 is a flowchart showing an operation example (job execution management method) of the job execution management system 100 shown in FIG.

The manager device 102 identifies and gives priority to a job that can start using the exclusive resource earliest after the lock of the exclusive resource is released from all the jobs queued in the agent device 104. It is executed (step S50).

When the job that uses the exclusive resource is not preferentially executed and the execution order is reached in the queue, the agent device 104 keeps the execution position of the job at the position where the job is executed next when the queue becomes free. The subsequent job is executed first (step S51).
(Explanation of effect)
According to the first embodiment described above, when there are a plurality of jobs that use the exclusive resource, it is possible to avoid waiting for the lock of the exclusive resource as much as possible and shorten the execution time of the entire job network. Of course, in that case, it is not necessary for the user to intentionally adjust the job scheduling time so that the execution timings do not overlap.

The configuration / operation of the manager device 102 and the agent device 104, and priority execution will be described in detail in the second embodiment below.
[Second Embodiment]
(Explanation of configuration)
FIG. 3 is a block showing a configuration example of the job execution management system 1 according to the second embodiment of the present invention. In a general job execution management system, it is common that there is a control means for starting a job network and controlling its flow according to a schedule. However, such control means are not directly related to the present embodiment and will be omitted in the following description.

The job execution management system 1 includes a manager device 2 that mainly executes job definition information management and job network flow control, and an agent device 3 that executes jobs. Although the case where the agent device 3 is "3" is illustrated in FIG. 3, the number of the agent devices 3 may be "2 or less" or "4 or more". good.

The manager device 2 includes a job execution control unit 10, a job definition information DB 11, and an exclusive resource management DB 13. DB is an abbreviation for Data Base.

The job definition information DB 11 includes a job name and a script, an estimated execution time which is an estimated time from the start to the end of execution of a job, a name of an exclusive resource, or identification information (hereinafter, these are also referred to as an exclusive resource name) for each job. Information such as is recorded as job definition information.

Exclusive resources are, for example, the transmission of huge data itself in the data transmission process to a printer in the print process, a backup destination area or tape device in the data backup process, or a server in another geographically distant data center. Is. Of course, the exclusive resource is not limited to the above.

The exclusive resource management DB 13 waits for all the exclusive resource names that can be used in the job execution management system 1, whether or not the exclusive resources are locked, the name of the locked job if it is locked, and the lock wait. Record the name of the job you are in.

The job execution control unit 10 reads the job definition information from the job definition information DB 11 and sends a job execution request (start of queuing) to the agent device 3. The job execution control unit 10 receives the lock acquisition request and the lock release request from the agent device 3, and registers these requests in the exclusive resource management DB 13.

The job execution control unit 10 has a lock control function for controlling the lock of the exclusive resource represented by the exclusive resource name. The lock control function does not have to be possessed by each application (agent apparatus 3) that handles exclusive resources, and may be possessed only by the manager apparatus 2. In this case, the information "which exclusive resource to use" is defined in advance as a parameter in the job definition information DB 11. The exclusive resource name may be simply character string information. For example, when the exclusive resource is the printer Z, it is agreed in advance that the lock is requested by the character string information "Z", and the job execution control unit 10 is exclusive when the lock request with "Z" is received. Take control.

The agent device 3 includes a job execution control unit 20. The job execution control unit 20 performs queue control and execution of a job requested to be executed by the manager device 2. The job execution control unit 20 returns the job execution result to the manager device 2. The job execution control unit 20 sends a "lock acquisition request" to the manager device 2 when a job using an exclusive resource is executed, and issues a "lock release request" when the execution of the job is completed. Send.

Then, in the job execution management system 1, priority control is executed in order to shorten the useless lock waiting time of the job using the exclusive resource. The priority control includes a first control (priority execution) by the job execution control unit 10 and a second control by the job execution control unit 20.

The first control has the following controls (1) to (4).
(1) Extraction of Jobs that Use Target Exclusive Resources The job execution control unit 10 extracts all jobs that use the target exclusive resources from the jobs queued in each agent device 3. When a plurality of such jobs exist in the same queue, the job execution control unit 10 targets only those queued in advance.
(2) Calculation of remaining required time In each queue in which the job of control (1) is queued, the job execution control unit 10 has "remaining required" required for the job currently being executed in that queue to end. Calculate "time". The calculation of the remaining required time is performed for all the target queues.

The remaining required time can be calculated from, for example, the expected execution time of the running job and the elapsed time from the start of the job execution. For example, the remaining required time can be calculated by the following (Equation 1).

Remaining required time = expected execution time-elapsed time (Equation 1)
The job execution time is the time from the start to the completion of the job on the agent device 3. The expected execution time is an expected value of the above-mentioned execution time. The predicted execution time can be estimated using, for example, past performance. Since the job execution management system 1 is a system characterized in that the same processing is executed in the form of daily, weekly, or monthly, the previous results can be referred to. Further, in the case of a job having a feature that the processing time increases according to the amount of input data, the job execution control unit 10 uses the data obtained by formulating the relationship between the amount of input data and the processing time. It is also possible to estimate the expected execution time from the amount of input data of the job to be executed.

The job execution control unit 10 acquires, for example, the expected execution time by referring to the job definition information DB 11. Further, the job execution control unit 10 acquires, for example, the elapsed time of each job by inquiring to each agent device 3.
(3) Determination of the queue that can be vacant first The job execution control unit 10 compares the remaining required time of each queue, which is the calculation result of control (2), and determines the queue that can be vacant first. ..
(4) Changing the job execution priority The job execution control unit 10 is queued first among the jobs that use the target exclusive resource and are queued in the queue determined in control (3). Change the execution position of the current job to "the position to be executed next when the queue becomes free" in the corresponding queue. If there is one queued job, the first queued job is that one job.

FIG. 4 is an image of the first control.

By executing the above controls (1) to (4) every time an exclusive resource becomes available, the job that uses the exclusive resource is preferentially executed, and the lock wait of the exclusive resource is prevented from occurring as much as possible. be able to. The processes of the above controls (1) to (4) are "when the exclusive resource becomes free, the next job that can be started by using the exclusive resource is searched for and the job is preferentially executed". Can be summarized as.

When the queue execution order is reached without executing the first control for the job using the exclusive resource, the job execution control unit 20 executes the second control.

In the second control, when a job that uses an exclusive resource reaches the execution order in the queue without performing the above controls (1) to (4), the execution position of the job is set to "there is a free space in the queue". If possible, it is a control that keeps it in the position where it will be executed next and executes the subsequent job first.

By the second control, it is possible to prevent the execution of the subsequent job in the corresponding queue from being hindered by the job waiting for the lock of the exclusive resource.

However, when the second control is executed, there is a possibility that the determination of the control (3) and the control (4) will continue to be missed. In order to avoid this, a correction value is introduced in the calculation of the control (2) that influences the judgment of the control (3). This correction value is the excess time (the excess time when the expected start time from the time when the target job is queued in the agent device 3). For example, when a job is queued, it is possible to calculate how long it should wait from the expected execution time of the previously queued job to start executing the queued job. The excess time is the expected start time starting from the queuing time, and is not executed even after this expected start time, that is, the lock cannot be acquired by the priority control of another queue. It's time to be. Therefore, the job execution control unit 10 does not use the "remaining required time" calculated in the control (2) as the comparison target in the control (3), but subtracts the "excess time" from the "remaining required time". The value (that is, the corrected value) is used as the comparison target in the control (3).

The expected start time can be obtained by, for example, the following (Equation 2).

Estimated start time = Sum of expected execution times of unexecuted jobs that have been queued + Estimated execution time of currently running jobs-Elapsed time of execution of that job (Equation 2)
Further, the "excess time" can be obtained by the following (Equation 3).

Excess time = elapsed time since queuing-estimated start time (Equation 3)
A specific example of the first control is shown below. When the "remaining required time" is calculated as the calculation result of the control (2), it is assumed that the queue A is 20 seconds, the queue B is 30 seconds, and the queue C is 40 seconds. If no correction value is taken into consideration, the queue that can be vacated earliest is queue A. However, the job C0 queued in the queue C reached the top of the queue without being subject to the controls (1) to (4), but the exclusive resource was also locked and could not be used by another job. It is assumed that the subsequent job is executed first by the control (5). If the waiting time (excess time) is, for example, 30 seconds, the corrected "remaining required time" of the queue C is 40-30 = 10 seconds. Therefore, the job to be executed next, which is determined by the control (3) and the control (4), is the job C0 which is queued in the queue C and is waiting for a lock.
(Explanation of operation)
(Explanation of general operation)
FIG. 5 is a flowchart showing an example of the first control.

The process shown in this flowchart is a job execution request to the agent device 3 when the lock of any of the exclusive resources registered in the exclusive resource management DB 13 is released, or for a job for which an exclusive resource name is set. Is executed when is done.

The target exclusive resource is an exclusive resource whose lock has been released in the former case, and is an exclusive resource set in the job for which the execution request has been made in the latter case. In the following description, this exclusive resource name is Z.

The job execution control unit 10 makes an inquiry to the job execution control unit 20 of each agent device 3, and among the jobs queued in the queue of each agent device 3, all jobs X1 that use the exclusive resource Z. Is extracted (step S1). If there are multiple jobs that use the exclusive resource Z in the same queue, only those that have been queued in advance are targeted.

If there is no job X1 (No in step S1), the processing of this flowchart ends.

When one or more jobs X1 exist (Yes in step S1), the job execution control unit 10 calculates the remaining required time X2 of the job currently being executed in each queue to which the job X1 belongs (step S2). The calculation method of the remaining required time X2 is as described above.

The job execution control unit 10 corrects the remaining required time X2 and calculates the corrected remaining required time X3 (step S3). Specifically, the job execution control unit 10 calculates the excess time with respect to the expected start time of the job X1. The calculation method of the expected start time and the excess time is as described above. Then, the job execution control unit 10 calculates the corrected remaining required time X3 by subtracting the excess time from the remaining required time X2.

The job execution control unit 10 compares the remaining required time X3 after correction of each queue with each other, and determines the queue X4 that can be vacant first (step S4). The job execution control unit 10 transmits an instruction to change the position of the job to the job execution control unit 20 of the agent device 3 having the queue X4.

Based on the above instruction, the job execution control unit 20 changes the position of the first queued job among the jobs that use the exclusive resource Z in the queue X4 to the "position that can be executed next" (the position that can be executed next). Step S5).

FIG. 6 is a flowchart showing an example of the second control.

The job execution control unit 20 determines whether or not the job using the exclusive resource has reached the execution order in the queue without being preferentially executed (without executing the first control) (step S10). When a job that uses an exclusive resource reaches the execution order in the queue without being preferentially executed (Yes in step S10), the job execution control unit 20 sets the execution position of the job to "Next when the queue becomes free". The subsequent job is executed first (step S11).

When the job has not reached the queue execution order without the first control being executed (No in step S10), and when the process of step S11 is completed, the process of this flowchart ends.
(Explanation of specific operation)
Hereinafter, priority control will be specifically described with reference to FIGS. 7 to 32. 7 to 22 of FIGS. 7 to 32 are diagrams for explaining the present embodiment, and FIGS. 23 to 32 are for explaining the method of the related technology to which the present invention is not applied. It is a figure.

The premise of the explanation is as follows.
-It is assumed that there are three agent devices 3, and each agent device 3 has only one queue (queues A, B, and C).
-At the start, it is assumed that the job queuing as shown in FIG. 7 has been performed. FIG. 7 shows that the lower the job is, the more the job is queued in advance, and the job written below the double line is the job in the execution state.
-In FIG. 7, bold letters in the job column represent jobs for which the exclusive resource Z is set (jobs A5, B2, C5).
-In FIG. 7, "forecast" is a simplification of the expected execution time.
-In FIG. 7, "excess" is a simplification of the excess time.
-In order to make the explanation clearer, it is assumed that the extraction in step S1 is completed, and as a result, the queue A, the queue B, and the queue C shown in FIG. 7 are always hit.
It is assumed that job A7 (estimated execution time: 20 seconds) is additionally input to queue A after 60 seconds, and job C6 (estimated execution time: 20 seconds) is additionally input to queue C after 100 seconds.
■ Start time Since the exclusive resource Z has a vacancy at the start time (Fig. 7), priority control is executed. The remaining required time as a result of step S2 is A = 10, B = 80, and C = 20, respectively. And since the excess time is all 0, the remaining required time is not corrected. Therefore, the queue that can be executed fastest is queue A. Then, the job A5 in the queue A is moved immediately after the job A1 (FIG. 8).
■ 10 seconds after the start 10 seconds later, the job A1 is completed, and the job A5 using the exclusive resource Z is started to be executed (FIG. 9).
■ 30 seconds after the start 20 seconds after the state shown in FIG. 9, job A5 is completed and the lock of the exclusive resource Z is released. At this time, priority control is executed again (FIG. 10).

In this case, the comparison targets are job B2 and job C5. The earliest executed queue without correction because there is no overtime is queue C. Therefore, the job C5 is moved immediately after the job C2 (FIG. 11).
■ 50 seconds after the start 20 seconds after the state shown in FIG. 11, job C2 is completed and execution of job C5 using the exclusive resource Z is started (FIG. 12).
■ 60 seconds after the start 10 seconds after the state shown in FIG. 12, A7 (estimated execution time: 20 seconds) is newly queued in the queue A (FIG. 13).
■ 80 seconds after the start Job B1 is completed 20 seconds after the state shown in FIG. At this time, since the job B2 to be executed next is a job that uses the exclusive resource Z, a conflict occurs. Therefore, the job execution control unit 20 requests the acquisition of the lock of the exclusive resource Z (waiting for the lock), and starts the execution of the subsequent job B3 first (FIG. 14).
■ 90 seconds after the start 10 seconds after the state shown in FIG. 14, job C5 is completed and the lock of the exclusive resource Z is released. At this time, priority control is executed again (FIG. 15).

In this case, the comparison targets are job A7 and job B2. And there is an excess time in job B2. Taking this into consideration, the remaining required time after correction is cue A = 0 and cue B = 30-10 = 20, respectively, and cue A is smaller. Therefore, the position of job A7 is moved. In this case, since there is no job being executed, the execution of job A7 is started as it is (FIG. 16).
■ 100 seconds after the start 10 seconds after the state shown in FIG. 16, C6 (estimated execution time: 20 seconds) is newly queued in the queue C (FIG. 17).
■ 110 seconds after the start 10 seconds after the state shown in FIG. 17, job A7 is completed and the lock of the exclusive resource Z is released. At this time, priority control is executed again (FIG. 18).

In this case, the comparison targets are job B2 and job C6. And there is an excess time in B2. Taking this into consideration, the remaining required time after correction is cue B = 10-30 = -20, cue C = 0, and cue B is smaller. Therefore, the position of job B2 is moved. In this case, since the job B2 is already in the "position to be executed next", the move process becomes unnecessary. Further, since the queue C was not the target of the priority control, the execution of C4 is started in order (FIG. 19).
■ 120 seconds after the start 10 seconds after the state shown in FIG. 19, job B3 is completed, and job B2 using the exclusive resource Z is started to be executed (FIG. 20).
■ 160 seconds after the start Job C4 is completed 40 seconds after the state shown in FIG. 20. At this time, since the job C6 to be executed next is a job that uses the exclusive resource Z, a conflict occurs. Therefore, the job execution control unit 20 requests the acquisition of the lock of the exclusive resource Z. Since there is no subsequent job that can be executed in the queue C, the queue C is a queue that does not execute any job while the job C6 stays at the "position to be executed next" (FIG. 21).
■ 170 seconds after the start 10 seconds after the state shown in FIG. 21, job B2 is completed and the lock of the exclusive resource Z is released. Since the exclusive resource Z is already waiting for the lock of the job C6, the job C6 acquires the lock and transitions to the execution state (FIG. 22).
■ 190 seconds after the start After 20 seconds from the state shown in FIG. 22, job C6 is completed and all jobs are executed.

As described above, in the present embodiment, all the jobs are executed in 190 seconds in total.

Next, in order to show the effect of the present embodiment, the operation and the total execution time when the job is executed by the method of the related technology to which the present invention is not applied will be described. As this method, the third method (see [Problems to be Solved by the Invention]), which is said to have the least disadvantages, is adopted. The preconditions are the same as those described above. Further, instead of the "excess" column, the "lock" column is described, and the order of waiting for the lock acquisition of the exclusive resource Z is described here. It is shown that the job whose value is 1 is currently locking the exclusive resource Z.
■ Start time The start time is shown in Fig. 7, and execution is performed according to the queued order from this state.
■ 60 seconds after the start 60 seconds after the state shown in FIG. 7, a new job A7 (estimated execution time: 20 seconds) is queued in the queue A (FIG. 23).
■ 70 seconds after the start Job A4 is completed 10 seconds after the state shown in FIG. 23. Subsequent job A5 requests a lock because it is a job that requires exclusive resource Z, but since there is no other job that locks exclusive resource Z, the lock can be acquired and execution starts as it is (FIG. 24). ..
■ 80 seconds after the start Job B1 is completed 10 seconds after the state shown in FIG. 24. At this time, since the job B2 to be executed next is a job that uses the exclusive resource Z, a conflict occurs. Therefore, the lock acquisition request for the exclusive resource Z is executed, and the subsequent execution of the job B3 is started first (FIG. 25).
■ 90 seconds after the start 10 seconds after the state shown in FIG. 25, the job A5 is completed and the lock of the exclusive resource Z is released. Since the exclusive resource Z has already been requested to be locked by the job B2, the job B2 acquires the lock of the exclusive resource Z (FIG. 26).
■ 100 seconds after the start 10 seconds after the state shown in FIG. 26, C6 (estimated execution time: 20 seconds) is newly queued in the queue C (FIG. 27).
■ 110 seconds after the start Job A6 is completed 10 seconds after the state shown in FIG. 27. Since the subsequent job A7 is a job that uses the exclusive resource Z, a lock request is made, but since the job B2 has already acquired the lock, a wait occurs. In queue A, there is no subsequent job that can be executed. Therefore, the queue A is a queue that does not execute any job (FIG. 28).
■ 120 seconds after the start Job B3 and job C4 are completed 10 seconds after the state shown in FIG. 28. Subsequent job B2 is a job that uses the exclusive resource Z, but since the lock has already been acquired, execution is started as it is. Further, the subsequent job C5 is also a job that uses the exclusive resource Z and requests a lock, but since another job has already been locked, a wait occurs. Further, since the job C6 succeeding the job C5 is also a job that uses the exclusive resource Z, it cannot be executed in advance, so that it remains as it is, and the queue C becomes a queue in which nothing can be executed (FIG. 29).
■ 170 seconds after the start 50 seconds after the state shown in FIG. 29, the job B2 is completed and the lock of the exclusive resource Z is released. Subsequently, the job A7 acquires the lock of the exclusive resource Z and starts execution (FIG. 30).
■ 190 seconds after the start 20 seconds after the state shown in FIG. 30, job A7 is completed and the lock of the exclusive resource Z is released. Subsequently, the job C5 acquires the lock of the exclusive resource Z and starts execution (FIG. 31).
■ 230 seconds after the start 40 seconds after the state shown in FIG. 31, job C5 is completed and the lock of the exclusive resource Z is released. Subsequently, the job C6 acquires the lock of the exclusive resource Z and starts execution (FIG. 32).
■ 250 seconds after the start After 20 seconds from the state shown in FIG. 32, the job C6 is completed and the execution of all the jobs is completed.
(Explanation of effect)
As described above, in the third method, all jobs are executed in a total of 250 seconds.

Comparing this embodiment with the third method, there is a difference of 250-190 = 60 seconds. That is, according to the present embodiment, the execution time of the entire job is improved by about 25% as compared with the third method, which is said to have the least demerits among the methods used before the present embodiment. You can see that. That is, according to the second embodiment described above, when there are a plurality of jobs that use the exclusive resource, it is possible to avoid waiting for the lock of the exclusive resource as much as possible and shorten the execution time of the entire job network. .. Of course, in that case, it is not necessary for the user to intentionally adjust the job scheduling time so that the execution timings do not overlap.

Although the present invention has been described above using each embodiment, the technical scope of the present invention is not limited to the description of each of the above embodiments. It is obvious to those skilled in the art that various changes or improvements can be made to each of the above embodiments. Therefore, it is needless to say that such modified or improved forms are also included in the technical scope of the present invention. Further, the numerical values and the names of the respective configurations used in the above-described embodiments are exemplary and can be changed as appropriate.

1 Job execution management system 2 Manager device 3 Agent device 10 Job execution control unit 11 Job definition information DB
13 Exclusive resource management DB
20 Job execution control unit 100 Job execution management system 102 Manager device 104 Agent device

Claims (5)

A manager device that manages jobs and
It comprises one or more agent devices that execute the job.
The manager device identifies the job that can start using the exclusive resource earliest after the lock of the exclusive resource is released from all the jobs queued in the queue of the agent device. And give priority to execution
When the job using the exclusive resource reaches the execution order in the queue without being preferentially executed, the agent device is executed next when the execution position of the job becomes available in the queue. A job execution management system characterized in that the following jobs are executed first by keeping them in a certain position. The manager device is
All the jobs that utilize the exclusive resource are extracted from the jobs queued in the queue of each of the agent devices.
By calculating the remaining required time of the job currently being executed in the queue to which the extracted job belongs, and subtracting the excess time, which is the time for waiting without acquiring the lock, from the remaining required time. Calculate the remaining required time after correction,
The remaining required time after correction of each of the queues is compared with each other to determine the queue that can be vacant first.
For the agent device having the queue that can be freed first, the execution position of the job that is queued first among the jobs that use the exclusive resource in the queue is freed in the queue. The job execution management system according to claim 1, wherein the job execution management system is instructed to change to the position to be executed next when the job execution is completed. The remaining required time is the time obtained by subtracting the elapsed time from the start of execution of the job from the estimated execution time, which is the estimated value of the time from the start to the completion of the job in the agent device. The job execution management system according to claim 2, which is characterized. The job execution management system according to claim 2 or 3, wherein the excess time is a time obtained by subtracting an expected start time from the elapsed time since the job was queued. A job execution management system including a manager device that manages a job and one or more agent devices that execute the job.
The manager device identifies the job that can start using the exclusive resource earliest after the lock of the exclusive resource is released from all the jobs queued in the queue of the agent device. And give priority to execution
The agent device is executed next when the job using the exclusive resource reaches the execution order in the queue without being preferentially executed, and the execution position of the job becomes available in the queue. A job execution management method characterized in that the subsequent job is executed first by keeping the position in a certain position.

Images