JPH064308A - Batch processing scheduling system - Google Patents

Abstract

PURPOSE:To enable classification corresponding to the priority of queues to be executed and queues having various attributes in the same class to be set by comparing the priority of a queue, of which priority is registered in a job, with the priority of a job registered on the other queue having the same priority, and deciding the order of execution, without closing the queues, of which priority is registered in the job. CONSTITUTION:A queue priority managing part 1 investigates which queue is to be started to be scheduled with, selects a queue '1' having the most significant queue priority, investigates whether the job to be selected for being executed is still registered on the queue '1' or not, selects the queue '1' as the object of schedule and informs a job priority managing part 2 of it. The job priority managing part 2 decides the job to be executed by comparing the priority of all the jobs in the candidate key. When the job to be executed is decided, that job is executed by a job execution part 3. Thus, the queues are successively selected, and the job having the higher priority is executed.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a batch processing system for executing execution scheduling by a queue, and in particular,
The present invention relates to a batch processing scheduling method when determining a priority that affects scheduling of a batch procedure.

[0002]

2. Description of the Related Art Conventionally, in this type of batch processing system, the priority of a queue set in a queue that determines which queue is registered to execute a request first, and which request is executed in the queue first. The job execution order is determined according to the priority set for the job.

These two priorities are completely different,
The priority set for the job is the one closed in the queue.

[0004]

In the conventional batch processing system described above, the priority set for the job is closed in the queue, and when the priority of the queue is considered, the priority of the job is not considered at all. Therefore, if queues having the same priority are created, the result is that jobs registered in a specific queue are prioritized even though the queues have the same priority. In other words, if two or more queues having the same priority are created, there will be inconsistency in the classification of queues according to the priority. Therefore, only one queue can be set for each class, and queues with different attributes cannot be set within the class, which is difficult to operate.

[0005]

According to the present invention, the priority set for a job is not closed in the registered queue, and is compared with the priority of a job registered in another queue having the same priority. However, the execution order is determined.

According to the present invention, in a batch processing scheduling method of a system for controlling execution of jobs of each batch procedure by a queue, the priority specified in the queue and the priority specified in the job are combined at the same level to execute the order of execution. It is characterized by determining.

[0007]

DESCRIPTION OF THE PREFERRED EMBODIMENTS Next, the present invention will be described with reference to the drawings.

FIG. 1 is a block diagram of an embodiment of the present invention. In FIG. 1, 1 is a queue priority management unit that monitors the priority of each queue, 2 is a job priority management unit that monitors the priority of jobs, and 3 is a job execution unit that executes jobs.

FIG. 2 is a diagram for explaining a job execution scheduling process.

As shown in FIG. 2, queue1 (priority level 5)
0), queue2 (priority 30), queue3 (priority 30), queue4 (priority 30), queue
5 queues with priority 5 (priority 10)
s (priority 50), middle class (priority 30), low class (priority 10) are divided into three classes for operation, and job 1 is assigned to queue1.
(Priority 20), job 2 (queue 3)
0), job 3 (priority 40) and job 4 (priority 10) in queue 3, and job 5 (priority 5) in queue 4
An example will be described in which the jobs of job 6 (priority 50) and job 7 (priority 20) are registered in 0) and queue 5, respectively.

First, the process of selecting the first job to be executed from the state of FIG. 2 is as follows.

First, the queue priority management unit checks from which queue to schedule, selects queue1 having the highest queue priority, and the job to be selected for execution is still registered in queue1. Check if Since job 1 has not been executed yet, queue1 is selected as the schedule target and the job priority management unit is notified.

Secondly, the job priority management unit compares the priorities of all the jobs in the candidate queue and determines the job to be executed. In this case, the job registered in queue1 is only job 1, so that job is selected.

Thirdly, when the job to be executed is determined, the job is executed by the job executing section.

The process of selecting the second job to be executed is as follows.

[0016] First, the queue priority management unit is queu.
The only request job 1 registered in e1 has already been selected, so the queue with the highest priority, queue1
Determines that there are no more requests to choose from to execute, and queue2 of the next highest priority queue,
select queue3, queue4, queue2,
It is checked whether jobs to be selected for execution are registered in queue3 and queue4. que
Since jobs to be selected for execution still remain in ue2, queue3, and queue4, queue2, queue3, and queue are targeted for scheduling.
Select e4 and notify the job priority management unit.

Secondly, the job priority management unit is queu
The priorities of job 2, job 3, job 4, and job 5 registered in e2, queue 3, and queue 4 are compared, and job 5 with the highest priority is selected.

Thirdly, the selected job 5 is executed by the job executing section.

The third choice is as follows.

First, the queue priority management unit uses queue.
The only request job 1 registered in e1 has already been selected, so the queue with the highest priority, queue1
Determines that there are no more requests to choose from to execute, and queue2 of the next highest priority queue,
select queue3, queue4, queue2,
Check whether the jobs to be selected for execution are registered in queue3 and queue4. queu
The jobs to be selected for execution still remain in e2, queue3, and queue4, so queue2, queue3, and queue are to be scheduled.
4 is selected and the job priority management unit is notified.

Secondly, the job priority management unit is queu
The priorities of job 2, job 3, and job 4 registered in e2, queue 3, and queue 4 are compared, and job 3 with the highest priority is selected.

Thirdly, the selected job 3 is executed by the job executing section.

Thereafter, the fourth job and the fifth job are selected and executed in the order of job 2 and job 4 as in the case of the third case.

The sixth choice is as follows.

First, the queue priority management unit determines that the queue with the highest priority, queue1, no longer has a request to select for execution, and the queues with the queues with the second highest priority, queue2 and queue3. , Queue
4 is selected, but queue2, queue3, que
It judges that there is no request to be selected for execution by ue4, and selects queue5 having the next highest priority. Since jobs to be selected still remain in queue5, queue5 is selected as a schedule target, and the job priority management unit is notified.

Secondly, the job priority management unit is queu
The priorities of the jobs 6 and 7 registered in e5 are compared, and the job 6 having the highest priority is selected. 3. The job execution unit executes the selected job 6.

Finally, the request registered in queue 5 and job 7 are selected and executed as in the case of job 6.

[0028]

As described above, according to the present invention,
You can now classify by queue priority,
In addition, since a plurality of queues having the same priority can be set, queues having different attributes can be set in the same class.

[Brief description of drawings]

FIG. 1 is a block diagram showing an embodiment of the present invention.

FIG. 2 is a block diagram illustrating the operation of an embodiment of the present invention.

[Explanation of symbols]

 1 queue priority management unit 2 job priority management unit 3 job execution unit

Claims (1)

[Claims] 1. In a batch processing scheduling method of a system for controlling execution of jobs of each batch procedure by a queue, the priority specified in the queue and the priority specified in the job are combined at the same level to determine the execution order. A batch processing scheduling method characterized by: