JPS6162946A - Method for controlling job reschedule - Google Patents

Abstract

PURPOSE:To regenerate a cue and to make a reschedule possible by stocking job schedule state information in a state definition area of a job reference controlling table and detecting an abnormal cue in a cue checking part of job scheduling device. CONSTITUTION: In a job controlling system that the cue control is performed in respondence a job reference controlling table with a schedule state of each job; a schedule state code, showing which of cue terminals 1-1-1-5 queues the table 2 in a state definition area 3 provided in the table 2 is stocked, and the definition are 3 is updated at the replacement of the cue. A cue check part 4 and a rescheduling part 5 are provided at job scheduling device. When an abnormal cue in the table 2 is detected by the check part 4, the rescheduling part 5 is driven to recover the cue based on the state code of the definition area 3 to attain the reschedule of jobs.

Description

Detailed Description of the Invention (1) Technical Field of the Invention The present invention provides a job rescheduling control method, in particular, a job rescheduling control system that is capable of rescheduling control when a contradiction occurs due to a software failure or the like in the pointer relationship of a job correspondence control table in which queue control is performed. The present invention relates to a job rescheduling control method that detects job schedule triggers and performs recovery processing, thereby making it possible to automatically reduce job risk by -1.

(2) Technical background and problems In general, when multiple events occur in a data processing system and some processing is performed in response to each event, control information for each event is stored in a control table, and these control tables are Queue control is being done. By queue control, for example, F I F O (FirstIn First 0
It is now possible to manage priorities using UT), and the processing speed can be improved.

The unit of processing requests submitted by users to the data processing system is called a job, and a control table is assigned to each job, and the schedule for job processing is managed using queue control. things are being done. After a job is accepted by the system, its schedule status changes to Waiting for execution, Running, Waiting for output, and Outputting. During these job transitions, mutual pointers between control tables for queue control are changed. It will be done. Conventionally, there have been the following problems regarding this queue control.

FIG. 1 shows a diagram explaining the problems of the conventional method. In the figure, 1 represents a queue terminal, and 2-1 to 2-3 represent job correspondence control tables.

A queue terminal 1 is provided for each job schedule state and holds a head pointer to a job correspondence control table belonging to that state. Job correspondence control table 2-1 to 2-3
is assigned to each job accepted by the system, and stores information regarding the execution schedule and output schedule of that job. Each job correspondence control table 2-1 to 2-3 is provided with pointer sections P1 to P3, and chaining from the queue terminal 1 is performed by these pointer sections P1 to P3. Under normal conditions, the pointer is correctly drawn, as shown in FIG. 1A, for example, and no problem occurs. However, in the past, for example, due to software failure or reference control table destruction when resetting the pointer,
As shown in FIG. 1(B), when there is a contradiction in the mutual relationship between pointers, a program interrupt occurs by accessing based on the information in the pointer section P2.
There have been problems such as system downtime or failure to control the subsequent jobs listed in Job Correspondence Control Table 2-3. In addition, in order to speed up the processing, as shown in FIG.
~Q3, but the problem is the same when a contradiction occurs in the pointers.

(3) Object and Structure of the Invention The present invention aims to solve the above problems, enables recovery processing when a pointer used for queue control is abnormal, and reschedules a job corresponding to a control table in which the pointer relationship is interrupted. The purpose is to make it possible. Therefore, the job rescheduling control method of the present invention is applicable to a job management system that performs queue control and manages a job correspondence control table that stores information about each job submitted to the system in accordance with the schedule status of each job. , a status setting area is provided in the job correspondence control table to store the schedule status information of the job to which the job correspondence control table is assigned, and a queue for checking the normality of the queue of the job correspondence control table at the job schedule trigger. - a checking unit, and a rescheduling unit that plays the queue and reschedules the corresponding job based on the schedule status information stored in the status setting area when the queue check unit detects an abnormality in the queue. It is characterized by the following. This will be explained below with reference to the drawings.

(4) Embodiment of the Invention FIG. 2 is a schematic explanatory diagram of the present invention, FIG. 3 is a configuration diagram of an embodiment of the invention, and FIG. 4 is a diagram illustrating control of an embodiment of the invention.

In Figure 2, 1-1 is an empty queue terminal that queues unused job correspondence control tables to which no jobs are assigned, and 1-2 is a job correspondence control table for jobs waiting to be executed. Execution queue terminal for queuing tables; 1-3 is an execution queue terminal for queuing job correspondence control tables for jobs in execution status; 1-4 is job correspondence control for jobs in output waiting status. Output waiting queue terminal for queuing tables; 1-5 are output queue terminals for queuing job correspondence control tables of jobs in the output raw state; 3 is a status setting area provided for job correspondence control table 2. , 4 is a queue that checks the validity of the queue.
The checking unit 5 represents a rescheduling processing unit.

The F section of each queue terminal 1-1 to 1-5 stores a pointer to the first job correspondence control table belonging to that queue, and the L section stores a pointer to the last job correspondence control table. Ru. Further, the N section stores the total number of job correspondence control tables belonging to the queue. The E section of the job correspondence control table 2 stores the entry number of the job correspondence control table 2, and the entry number of this E section is used as the value of the pointer. The Q section is a reverse pointer pointing to the immediately preceding job correspondence control table in the same queue, and the P section is a pointer to the subsequent job correspondence control table.

In the present invention, each job correspondence control table 2 is particularly provided with a status setting area 3. In this status setting area 3, the job correspondence control table 2 shows which queue/terminal 1-1 to
A schedule status code indicating whether the schedule is queued in 1-5 is stored. Status setting area 3 is updated when the schedule status of the job changes, that is, when the queue is replaced, and is referenced when restoring the queue to a normal status and rescheduling when the queue is abnormal. .

The queue check unit 4 is activated when a job is scheduled, and traces the queues of each of the queue terminals 1-1 to 1-5 to check whether the pointers in the job correspondence control table 2 are correct. This check is
For example, this is done by determining whether the pointer values of the Q section and P section of the previous and succeeding job correspondence control tables are consistent, and whether the schedule status code is a code that is allowed within the queue. If an abnormality in the queue is detected, the rescheduling processing unit 5 is activated. The rescheduling processing unit 5 returns the queue to a normal state based on the information stored in the status setting area 3 and reschedules the job. That is, regardless of the queue pointer, each job correspondence control table 2 is
Since the status setting area 3 has information on which queue it belongs to, even if the pointer is cut off due to a failure, the status setting area 3 can be referenced to restore the queue. At this time, although the order of jobs may be disrupted,
There are no problems with processing that is limited to one job, and system stoppages that conventionally occur can be avoided.

FIG. 3 shows the overall configuration of an embodiment of the present invention. In the figure, 1-
1 to 1-5 to 5 correspond to FIG.

6 is a schedule processing unit, 10 is a job scheduler
Tasks, 11 is a reader task, 12 is a conversation processing task, 13 is a batch processing task, 14 is a writer task, 1
5 is a card reader, 16 is a magnetic tape device, 17 is a terminal, 18 is a line printer, 20 is a job schedule queue, and 21 is a job schedule control table.

Jobs include, for example, center batch jobs that are input by the reader task 11 from the card reader 5, magnetic tape device 16, etc. installed at the center, and remote batch jobs that are applied for by the conversation processing task 12 from the terminal 17. .

When these jobs are applied for, the job schedule task 10 secures an unused job correspondence control table from the free queue terminal 1-1 of the job schedule queue 20 for each job, and performs schedule control such as job attributes. The information is written and the job correspondence control table is queued to the execution queue terminal 1-2. The job that is waiting to be executed is batch job processing task 1.
3, and the writer task 14 outputs the execution result to the line printer 18 or the terminal 17. Along with this state transition, the job correspondence control table is changed to the execution queue terminal 1- 2 to the queue of running queue terminals 1-3, and from running queue terminals 1-3 to output waiting queue terminal 1.
-4, the queue pointer is changed from the output waiting queue terminal 1-4 to the output queue terminal 1-5. When the output is completed and the job processing is completed, the job correspondence control table is returned to the free queue terminal 1-1.

The job schedule queue 20 is managed in the form of a job schedule control table 21 in the memory 2, for example. The job schedule control table 21 has a queue/terminal section for each schedule state and a job correspondence section, and each entry in the job correspondence section becomes a job correspondence control table 2-1 to 2-n. Job correspondence control table 2-1~
As explained in FIG. 2, 2-n has an E section, a Q section, and a P section, and in particular, a state setting area 3 is provided. As described above, the schedule status code corresponding to the job processing status is set in the status setting area 3.

Management or updating of the job schedule control table 21 is as follows:
All of this is done by the job schedule task 10. The job schedule task 10 uses the schedule processing unit 6 to check, for example, whether or not a job waiting to be executed can be completed during execution at each schedule trigger, and if possible, requests the batch job processing task 13 to execute the job. , a schedule status code indicating "running" in the job correspondence control table is set in the status setting area 3, and the queues are reconnected. The same applies when receiving an output request or notification of completion of the requested processing.

The schedule trigger is given when a job is accepted, when an execution end notification or an output end notification is received, or when a predetermined timer notifies the user that a predetermined time has elapsed. Given a schedule opportunity,
In the present invention, first, the queue check unit 4 is activated, and the consistency of the queue is checked. If the queue is normal, control is transferred to the schedule processing unit 6,
The same schedule processing as before is performed. Further, when a contradiction in the mutual relationship between pointers is detected, the rescheduling processing unit 5
is called to correct and reschedule the queue.

For example, assume that the execution queue is as shown in FIG. 4(A). The job correspondence control tables 2-1 to 2-5 queued in the execution waiting queue terminal 2-1 all store schedule status codes indicating the execution waiting state. In this state, due to a soft failure such as an addressing error in another system task,
It is assumed that the contents of the shaded area shown in FIG. 4(,B) have been destroyed.

Queue check unit 4 is waiting queue terminal 1
-2, an abnormality in the pointer is detected by following the queue. A pointer abnormality can be detected, for example, by checking the normality of the reverse pointer Q and the schedule status code. When an abnormality is detected, the rescheduling processing unit 5 is called.

The rescheduling processing unit 5 uses the head pointer F and the last pointer I of the pending queue terminal 1-2 to
As shown in FIG. 4(C), job correspondence control tables 2-1.2-2.2-5 that have not been destroyed are first requeued. Next, as shown in FIG. 4(D), the job correspondence control tables 2-3 and 2-4 are restored based on the schedule status code, and the queue shown in FIG. 4(C) and the queue shown in FIG. 4(D) are restored.
By combining with the illustrated cue, the normal state can be restored.

In addition, if the status setting area 3 in which the schedule status code is stored is also destroyed, for example, as shown in FIG. 4(D).
The illustrated job correspondence control table 2-3.2-4 cannot be repaired, but the unknown job correspondence control table 2-3.
3.2-4 is to prevent the system from going out of control in advance by forcibly returning to the empty queue terminal 1-1, or by creating a new faulty queue terminal and queuing there. It can be prevented.

(5) As described in detail, according to the present invention, it is possible to localize the scope of failure and avoid system downtime, and it is also possible to automatically restore jobs by rescheduling. Become.

[Brief explanation of drawings]

Fig. 1 is an explanatory diagram of problems with the conventional method, Fig. 2 is a schematic explanatory diagram of the present invention, Fig. 3 is a configuration diagram of an embodiment of the present invention, and Fig. 4 is an explanatory diagram of control of an embodiment of the present invention. . In the figure, 1 represents a queue terminal, 2 represents a job correspondence control table, 3 represents a status setting area, 4 represents a queue check section, and 5 represents a rescheduling processing section. Patent applicant Fujitsu Limited (1 other person) Representative patent attorney Mori 1) Hiroshi (1 other person) 4th [! ] (D)

Claims (1)

[Claims] In a job management system that performs queue control and manages a job correspondence control table that stores information about each job submitted to the system in accordance with the schedule status of each job, the job correspondence control table is added to the job correspondence control table. In addition to providing a status setting area in which the schedule status information of jobs to which is assigned is stored, there is also a queue check unit that checks the normality of the queue in the job correspondence control table when the job is scheduled; A job rescheduling control method characterized by comprising: a rescheduling processing unit that plays a queue and reschedules the corresponding job based on schedule status information stored in the status setting area when an abnormality is detected in the status setting area. .