JPH0535506A - Program dispatch processing system - Google Patents

Abstract

PURPOSE:To surely dispatch the programs with preference to the data processing requests of the higher priority. CONSTITUTION:A data processor is provided with a request reception task 12 which accepts the data processing requests and an execution task 13 which receives the control of the task 12 and processes the data. A request queue terminal 14 is added to link the accepted data processing requests with each other according to the priority and also to control the data processing request under execution. A dispatcher means 16 which works with the task 12 carries out with preference the requests having higher priority than the request which is executed by the terminal 14 when the means 16 controls the data processing request carried out by the terminal 14. Thus these requests are controlled as the new data processing requests under execution.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a program dispatch processing method in a data processing apparatus having a configuration in which a plurality of tasks are used to process one data processing request, and particularly to a high priority data processing request. The present invention relates to a program dispatch processing method for surely dispatching a program for a.

In a computer used for an online system or the like, generally, a plurality of programs can be operated at a time by a plurality of tasks. In such a computer, when a data processing request to be urgently processed, such as a recovery processing request at the time of an abnormality, occurs, more tasks are preferentially assigned than other low priority data processing requests, A priority is set for each task, and the processing for the request is dispatched to the task with the higher priority. In this case, it is necessary to ensure that the program for a high-priority data processing request is dispatched with priority.

[0003]

2. Description of the Related Art Conventionally, a dispatcher program operating on a task is provided with a request queue terminal for managing the priority of data processing requests for each task, and a program for processing each data processing request in descending order of priority. Was adopted for dispatching.

That is, as shown in FIG. 5, a request queue terminal 1 for managing the priority of a data processing request is provided, and a control table 2 for processing requests is queued in the request queue terminal 1. Then, as shown in the processing flow of FIG. 6, the dispatcher program 3 operating on the task specifies the processing request control table 2 by referring to the queues in order from the highest priority, and specifies the specified control. The program corresponding to Table 2 is called and the links of the queue are changed, so that the program for processing each data processing request is dispatched in descending order of priority. With this configuration, if the example of FIG. 5 is explained, the programs associated with the control table 2 in the order from were dispatched in order.

[0005]

However, in such a conventional technique, when a plurality of tasks are used to process one data processing request, a program for a high priority data processing request is executed. There was a problem that it was not dispatched preferentially.

That is, as shown in FIG. 7, a program having a high-priority data processing request passes control to task B after processing of a certain phase in task A and transfers it to dispatcher program 3 on task A. When returning, this dispatcher program 3 will dispatch the program of the data processing request of the next priority. From now on, even if an attempt is made to execute a program of a high priority data processing request of the next phase on the basis of the processing result of the task B, the task A is occupied by the low priority data processing request. However, there was a problem that the execution was delayed.

The present invention has been made in view of such circumstances, and in a data processing device configured to process one data processing request by utilizing a plurality of tasks, a high priority data processing request is processed. It is an object of the present invention to provide a new program dispatch processing method that ensures that a program for the same can be dispatched with priority.

[0008]

FIG. 1 illustrates the principle configuration of the present invention. In the figure, 10 is a data processing device configured according to the present invention, and an operating system
And a request reception task 12 that receives a data processing request
And a request queue terminal 14 and one or more tasks 13 to which control is passed from the request receiving task 12 to execute data processing.

The request accepting task 12 develops a plurality of programs 15 for executing processing in response to a data processing request, and dispatcher means 16 for executing dispatch processing of these programs 15. The request queue terminal 14 includes a link area 17 for linking the data processing requests accepted by the request acceptance task 12 by priority.
In-process link area 1 for linking data processing requests in execution
8 and the link area 1
7 links request tables 19 displaying data processing requests by priority, and the in-process link area 18 links request tables 19 in data processing. A processing request control table 20 that displays processing requests for data processing requests is linked to these request tables 19.

When the request receiving task 12 receives a data processing request from the outside for the first time, it creates a request table 19 and links it to the link area 17 by priority. In addition, when a data processing request is received from the outside for the first time and when the processing is executed by the request receiving task 12 internally in synchronization with another task 13, the processing request control table 20 is created and linked to the request table 19. To do.

[0011]

In the present invention, the dispatcher means 16 has a higher priority than the request table 19 when the request table 19 is linked to the in-process link area 18 of the request queue terminal 14 at the end of the program processing. If there is a request table 19 of the highest priority request table 19 among the high request tables 19,
Is searched for, the program 15 indicated by the process request control table 20 is operated on the request receiving task 12, and the in-process link area 18 displays the request table 19 having the highest priority. Set to link. Although the request table 19 is linked to the processing link area 18, the request table 1
When there is no request table 19 having a higher priority than 9, the process request control table 20 linked to the request table 19 is searched and the program 15 indicated by the process request control table 20 is run on the request accepting task 12. ..

On the other hand, when the request table 19 is not linked to the in-process link area 18, the request table 19 linked to the request queue terminal 14 is searched in order of priority, and the request table 19 with the highest priority is specified. Then, the processing request control table 20 linked to the request table 19 is searched, the program 15 pointed to by the processing request control table 20 is run on the request receiving task 12, and the processing link area 18 has the highest priority. The degree request table 19 is set to be linked. At this time, if the processing request control table 20 is not found, the dispatcher means 16 returns to the operating system 11, and the request receiving task 12 enters a state in which nothing is done until it receives the data processing request.

When activated in this way, the program 15 operating on the request receiving task 12 executes prescribed data processing, and activates the program operating on the task 13 as necessary. .. On the other hand, when activated in this way, the program operating on the tax 13 links a new processing request control table 20 to the request table 19 of the in-process link area 18 that is the calling source, if necessary. Go

When the program 15 running on the request receiving task 12 finishes the program processing, it sends a final processing request linked to the request table 19 linked to the processing link area 18 to the dispatcher means 16. Since the dispatcher means 16 is notified of whether or not it is the one indicated by the control table 20, the dispatcher means 16 receives this notice and, in the case of the program process indicated by the last process request control table 20, the request table 19 and its request table 19. Processing request control table 2
0 is collected, and if it is not the program processing indicated by the last processing request control table 20, the processing request control table 2
Collect only 0.

According to the processing of the present invention, as will be described below, when a single data processing request is processed using a plurality of tasks, a program for a high priority data processing request is guaranteed. Will be dispatched preferentially. Hereinafter, for convenience of explanation, as shown in FIG. 1, the request table 19 linked to the in-process link area 18 (also linked to “high” in the link area 17) is linked to the request table a and the request table a. The two processing request control tables 20 are referred to as processing request control tables a-1 and a-2, the request table 19 linked to "medium" in the link area 17 is the request table b, and the processing linked to this request table b. The request control table 20 will be referred to as a process request control table b-1.

The program 15 of the processing request control table a-1 operating on the request acceptance task 12 requests the task 13 to process by a message, and upon receipt of this message, the task 1
The corresponding program that operates on 3 executes data processing to link the processing request control table a-2 to the processing request control table a-1. At this time, when the program 15 of the processing request control table a-1 finishes the program processing, the program 15 of the processing request control table a-1 sends the request table a to the dispatcher means 16 in accordance with the above processing.
Notify that it is not the last processing request. Upon receiving this notification, the dispatcher means 16 receives the request table a.
Has a higher priority than the request table b and does not become a condition for removing the request table a from the link area 18 being processed. Therefore, the program 15 of the process request control table b-1 of the request table b is requested according to the above processing. Do not operate on the reception task 12. From now on, the processing is completed in task 13,
The program 15 of the process request control table a-2, which is to be operated by the request reception task 12 according to the processing result, can immediately operate on the request reception task 12.

Program 15 of this processing request control table a-2
When the program processing is completed, the notification of the last processing request of the request table a is sent to the dispatcher means 16 according to the above-mentioned processing.
The program 15 of the processing request control table b-1 is operated on the request reception task 12 by linking to the. Thus, on the request reception task 12, the program 15 of the processing request control table a-1 and the program 1 of the processing request control table a-2
5. The program 15 in the processing request control table b-1 is dispatched in this order.

As described above, according to the present invention, in a data processing device configured to process one data processing request using a plurality of tasks, a program for a high priority data processing request is set. It will definitely be possible to dispatch with priority.

[0019]

The present invention will be described in detail below with reference to examples. As shown in FIG. 2, in an operating system capable of controlling a plurality of tasks and exchanging control by messages between the tasks, a data process for activating four tasks A to D to execute a data process. Assume a device as an example. Then, among these four tasks, it is assumed that task A is a task that accepts a command from an external terminal, and other tasks B to D are processing tasks that can perform parallel processing. Accepts commands from task B-D
When the control is passed to the corresponding task among the tasks, the tasks B to D execute the prescribed data processing to return the control to the task A, and when the tasks B to D return the control,
It is assumed that the task A executes processing for returning a command response to the terminal that issued the command. Here, 16a in FIG. 2 is a dispatcher program that operates on task A.

In such a data processing device, when the task A receives a request for a command with a low priority and then subsequently receives a request for a command for urgently recovering the error, the present invention Will be effective. That is, in such a case, the request queue terminal 14 described in FIG. 1 provided for realizing the present invention has a command request table 19 linked to “medium” in the link area 17 as shown in FIG. At the same time, the command request table 19 is linked to “high” in the link area 17. Then, the command request table 19 is linked with the process request-1 which is the command process request control table 20 and the process request-2 which is the process request control table 20 from the task B, and the command request table 19, a command processing request control table 20
The processing request-1 which is the processing request and the processing request-2 which is the processing request control table 20 from the task C are linked.

Before starting the description of the specific processing for this command /, the processing executed by the dispatcher program 16a operating on the task A will be described in detail according to the processing flow of FIG.

The dispatcher program 16a operating on the task A, at the end of the program processing,
As shown in the processing flow of FIG. 4, first, in step 1, it is determined whether or not the request table 19 is linked to the processing link area 18. If it is determined that no request table 19 is linked to the in-process link area 18 by this determination, the process proceeds to step 2 and the request table 19 linked to all the link areas 17 of the request queue terminal 14 is prioritized. The sequential search is performed to find the request table 19 having the highest priority and the process request control table 20 linked to the request table 19. On the other hand, if it is determined in step 1 that the request table 19 is linked to the in-process link area 18, the process proceeds to step 3 to give a higher priority to the request table 19 linked to the in-process link area 18. Degree request table 19
For the highest priority request table 19 among the high request tables 19 and the request table 19
And the processing request control table 20 linked to. At this time, if there is no request table 19 having a higher priority than the request table 19 linked to the processing link area 18, the request table 19 linked to the processing link area 18 and the request table 19 The linked processing request control table 20 will be found.

When the request table 19 is not found according to the processing of steps 2 and 3, that is,
When the processing request control table 20 is not found, the processing is ended as it is through step 4. On the other hand, if the request table 19 is found, the process proceeds to step 5 via step 4, and the found request table 19 is linked to the in-process link area 18. And the following step 6
Then, the program on the task A indicated by the found process request control table 20 is called. When called by the dispatcher program 16a in this manner, the program on the task A passes control to the corresponding task of the tasks B to D, and when this control is passed, the task B to
D executes a prescribed data process, and links a new process request control table 20 to the request table 19 in the in-process link area 18 which is the calling source, if necessary. And
When the program on the task A ends the program processing, the program on the task A notifies the dispatcher program 16a whether or not the last processing request control table 20 linked to the request table 19 indicates it. When the program 16a determines this notification in step 7 and determines that it is the last processing request control table 20, the program 16a proceeds to step 8 to request the request table 1
9 and its processing request control table 20 are collected. On the other hand, when it is determined that the processing request control table 20 is not the last one, the process proceeds to step 9, and only the processing request control table 20 is collected, and then step 1 Return to.

Next, this dispatcher program 16
A process to be executed for the above-mentioned command / shown in FIGS. 2 and 3 according to the process executed by a will be described.

Dispatcher program 16 for task A
When a receives a low priority command from the terminal,
The program indicated by process request-1 is started according to the above process. When activated in this way, the program pointed to by process request-1 passes its control to task B as a message and receives this control, as shown in FIG.
The above program executes command processing and creates a new processing request-2. At this time, a high priority command that requires urgency has not yet been issued, so
The in-process link area 18 has a command request table 19
Are linked. Then, as described above, the terminal issues a command of high priority which requires urgent attention. Then, the program indicated by the processing request-1 notifies the dispatcher program 16a that it is not the final processing request control table 20, and returns.

In response to this return, the dispatcher program 16a finds a command processing request-1 and starts the program indicated by the processing request-1 according to the above-mentioned processing even though the command is being processed. , The command request table 19 is linked to the in-process link area 18. When activated in this way, the program pointed to by process request-1 passes its control to the task C as a message as shown in FIG. 2, and the program on task C that receives this control processes the command. Execute to generate new processing request-2. Then, the program indicated by the processing request-1 notifies the dispatcher program 16a that it is not the final processing request control table 20, and returns.

On the other hand, the program on the task B to which the control is passed by the program indicated by the processing request-1 returns the control to the task A when the processing of the command is completed. At this time, since the in-process link area 18 links the command request table 19 at this time, the dispatcher program 16a receives the next process request even if the command B finish notification is received from the task B according to the above process. -It will return to the operating system without calling the program pointed to by 2.

After that, the program on the task C to which the control is passed by the program pointed to by the processing request returns control to the task A when the command processing is completed. At this time, the dispatcher program 1
6a immediately calls the program pointed to by process request-2 and executes it on task A in accordance with the above process. The program pointed to by this processing request-2, when the processing ends,
The dispatcher program 16a is notified that the processing request control table 20 is the last one, and the process returns. In response to this return, the dispatcher program 16a links the command request table 19 to the in-process link area 18 and calls the program pointed to by the process request-2 and executes it on the task A in accordance with the above-mentioned process. The processing pointed to by the program pointed to by process request-2 is
The dispatcher program 16a is notified that the processing request control table 20 is the last one, and the process returns.

In this way, the command of the higher priority command is called and executed on the task A with priority over the program of the lower priority command, so that the command request is issued. However, the processing will be terminated before the command is requested.

[0030]

As described above, according to the present invention,
In a data processing device configured to process one data processing request using a plurality of tasks, a program for a high priority data processing request is reliably dispatched preferentially. As a result, when a high priority data processing request is received after a low priority data processing request is received, the processing for the high priority data processing request is interrupted and processed during the low priority processing. As a result, the higher priority data processing request ends the processing first.

[Brief description of drawings]

FIG. 1 is a principle configuration diagram of the present invention.

FIG. 2 is an example of the present invention.

FIG. 3 is an example of the present invention.

FIG. 4 is an example of a processing flow executed by a dispatcher program.

FIG. 5 is an explanatory diagram of a conventional technique.

FIG. 6 is an explanatory diagram of a conventional technique.

FIG. 7 is an explanatory diagram of a problem of the conventional technique.

[Explanation of symbols]

 10 Data Processing Device 11 Operating System 12 Request Reception Task 13 Task 14 Request Queue Terminal 15 Program 16 Dispatcher Means 17 Link Area 18 Processing Link Area 19 Request Table 20 Processing Request Control Table

Claims (1)

What is claimed is: 1. A request receiving task (12) for receiving a data processing request, and one or a plurality of tasks (13) for executing data processing when control is passed from the request receiving task (12). ) And a data processing device comprising a request queue terminal (14) for managing the data processing requests being executed, while linking the data processing requests received by the request receiving task (12) by priority. The dispatcher means (16) operating on the request receiving task (12) has a higher priority than the data processing request when managing the data processing request being executed by the request queue terminal (14) at the end of the program processing. When there is a high priority data processing request, the program associated with the highest priority data processing request of the high priority data processing requests is dispatched. At the same time, the data processing request is managed as being executed, and when there is no high data processing request, the program associated with the data processing request being executed is dispatched, while the data processing request being executed is managed. A program dispatch processing method characterized by dispatching a program associated with a data processing request having the highest priority and processing the data processing request such that the data processing request is managed as being being executed.