JPS6337433A - Data processing system - Google Patents

Abstract

PURPOSE:To execute even data processing having a low priority level in a certain time by providing an execution counter for each of queues other than the queue having the lowest priority level and controlling the number of execution tasks in every priority level by the counter. CONSTITUTION:Tasks A1-Am1, B1-Bm1, and C1-Cm1 are queues in queues 4, 5, and 5 having priority levels RQ0, RQ1, and RQ2 respectively, and execution counters are provided for queues 4 and 5. In case of data processing, initial value '2' is set to execution counters of queues 4 and 5, and data is repeatedly processed in the order of tasks A1, A2, B1, A3, A4, B2, A5, A6, and C1, and tasks B and C having lower priority levels are processed between tasks A having the highest priority level by interruption. If the number of tasks in queues having lower priority levels is increased during system operation, initial values of execution counters are adjusted through an interruption accepting unit 46, an execution counter correcting part 47, and an I/O management table 48 by the input/output interruption from a detecting circuit 40. Thus, even the data processing having a lower priority level is executed in a certain time.

Description

[Detailed Description of the Invention] [Industrial Application Field] The present invention relates to a data processing method in an electronic computer or an information communication system, and particularly to a data processing method that reorganizes data processing procedures depending on the system situation. Regarding data processing methods.

[Conventional technology]

Traditionally, the task (data processing) scheduling method of the Kameko switchboard system has been described, for example, in the "
As described on pages 30 to 39 of "Introduction to Electronic Exchange Programs," the task queues by priority are examined in descending order of priority, and after all high-priority queues have been executed and fc, the next Task processing is performed according to the rule of checking the queue with the rank of .

[Problem that the invention seeks to solve]

The problem with the above-mentioned method is that as long as there are high-priority tasks, processing of low-priority tasks is postponed until later, so lower-priority data processing cannot be executed within a certain amount of time. was there.

SUMMARY OF THE INVENTION An object of the present invention is to provide a data processing method that solves the above-mentioned problems and allows even data processing with a low priority to be executed within a certain period of time.

Means to solve problem C] Is the above purpose the number of executed tasks by priority? After executing a predetermined number of high-priority tasks, the system executes task processing in such a way that it executes at least one task in the next order, and then returns to high-priority task processing again. achieved.

[Effect]

All execution counters and initial values for each counter are determined in advance for each priority level, except for low class ones, and once a predetermined number of tasks are processed starting from the highest class,
Let it handle the following class of tasks: Every time a task in rank F is processed, the execution counter of the upper class is set to the initial value, and the task of the highest class is also returned to its initial value. The tasks of the class are periodically given an opportunity to execute.

In this case, by making it possible to set the desired value of each counter variably depending on the system situation, even the lowest class task can be executed within a predetermined time. ] Hereinafter, the details of the present invention will be explained using an electronic exchange system as an example.
This will be explained with reference to the drawings.

FIG. 1 shows task queues 4, 5.6 from priorities RQO to Q2.

)IQO has the highest priority, followed by R and Ql.

It becomes lower in the order of 几Q2.

For example, the queue 4 with priority QO is lined with tasks A r -A at for handling system failures, and the queue 5 with priorities R and Ql is lined with tasks B1 for call processing.
-B1 are lined up, and the input/output device tasks L I -C,, 3 are lined up in the queue with priority RQ2.

Here, ml, In2, ff13 indicate the number of tasks in each queue.

In a single child exchange system, failure handling tasks must be executed with the highest priority. However, even if a failure occurs in some system, not only failure handling but also call processing tasks and call switching operations must be performed. Also, a response must be returned to the input/output device within a certain period of time.

FIG. 2 is an explanatory diagram of the 1-positive operation of the execution counter. When the detection circuit 40 detects an overload state, occurrence of a failure, or maintenance request of the central processing unit.

Alternatively, when a system call is issued from the user program 41, the execution counter 47 is corrected by the interrupt reception unit 46.

First, a scheduling method for data processing performed in the queue state of FIG. 1 will be described with reference to FIG. 3.

In the flowchart in Figure 3, two execution counters 几QO
It is assumed that I and QO2 are each initially set to "2" for the first shift.

First, in step 51, it is determined whether the execution counter QOI is "0". In this example, the value of RQol is “2”.
'', it is determined whether there is a task to be executed at the priority RQO level (step 52). R,QO
Since there are m+(fffiff minotasks at the level), data processing is executed for the first task A1 (step 53).

When this data processing is completed, the 1 shift of the execution counter RQO1 is decremented by 1 (step 54).As a result, the value of the execution counter QOI is "1".Step 54
When the process returns to step 51, the above-mentioned processing is repeated until the values of the execution counter R and QOI become "O", and the data processing for the two tasks AI (!:A2) of the fault handling system is executed. That will happen.

If the value of the execution counter 几QOI is "0", step 5
1 to 55, the value of the execution counter RQ01 is reset to the initial value "2", and in step 56 the execution power Rantal Q is reset.
It is determined whether the value of 12 is "0". In this example, since the execution counter Q12 has an initial value of "2", it is determined whether there is a task to be executed in the queue of priority Q1 (step 57). Since there are m2 tasks in this queue, the first task B! is executed (step 58), and when this is finished, the execution counter)? , the value of Q12 is decreased by 1 (step 59).
. In this example, the process returns to step 51 with RQ12=rlJ.

In step 51, the value of 几QOI is initial +! f, r2j
Therefore, tasks A3 and A4 of the highest priority failure handling system are executed one after another.

Steps 51 to 54 are repeated, and step 5
6, the value of the execution counter RQ12 is "1", so the next task B2 of priority Q1 is executed,
The process returns to step 51 with the execution counter RQ12 set to "0".

As tasks are processed in this way, priority RQ
When O's tasks As and A6 are completed, step 56
The process then proceeds to step 60, where the value of the execution counter l(, Q12 is reset to the initial value "2", and then, in step 61, it is determined whether or not there is a task in the queue 6 with priority RQ2. .

In this example, there are m3 tasks, so
The first task C1 will be executed, after which the process will return to step 51.

When the task with priority RQ2 is executed, the two execution counters R, QOI, and RQ12 all become initial values b, so the above-described procedure is repeated from the beginning. Therefore, if the initial values of execution counters RQQl, Fl, and Q12 are set to "2", A-A-B -A-A-B-A
By repeating -A-C, lower tasks B and C will be executed during the last task A. In this case, once all the top task A has been executed, B-B-C
- Lower tasks are executed in the order of B-B-C.

Next, while the system is running, the number of accepted input/output devices changes, and the task with priority RQ2 becomes solo<,m as shown in FIG.
Assume that fc increases from 3 to n3. Data processing for input/output devices must be executed within a certain amount of time, depending on the number of tasks.

In the present invention, when the interruption acceptance unit 46 receives the turnout interruption from the detection circuit 40 shown in FIG. Referring to the input/output device management table 48, the initial value of the execution counter RQ12 described above is adjusted.

While keeping the initial value of the execution QOI, which specifies the number of consecutive executions of the highest priority RQO, at "2", the next priority RQO is set to 0.
If the initial value set in the counter RQ12, which specifies the number of times 1 is executed, is changed to "1", then according to the flowchart of FIG. 3, the task execution order will be A-A-B-A-A-
Since C is repeated, the task cl of the input/output device can be increased from the current rate of once in nine times to once in six times. On the other hand, if the execution frequency of priority R,02 can be small δ, the execution counter R,QOI and R
For example, set the value of Q12 to "3" and "3" or "3".
” and “2”.

In this way, by changing the initial value of the execution counter according to the state of interrupts from the circuit 440 or the program 41, it is possible to interrupt low-priority tasks between high-priority tasks at an optimal frequency. You can do it.

〔Effect of the invention〕

According to the present invention, by reorganizing processing procedures between tasks with different priorities while the system is running, it is possible to optimally execute a low-priority task between high-priority tasks. .

[Brief explanation of drawings]

's1 is a diagram showing the task queue by priority.
The figure is a block diagram of a system that corrects the execution counter, Figure 3 is a flowchart showing the scheduling method for task processing, and Figure 4 is a diagram showing other states of the task queue.RQO~RQ2...Priority Rank, 4-6...Task queue, A H" Ca3...Task.

Claims (1)

[Claims] 1. In a data processing method for processing tasks that consist of queues organized by priority, a counter is provided for each queue, except for the queue with the lowest priority, and the tasks are handled in order starting from the queue with the highest priority. The execution order is controlled so that the number of tasks specified by the counter is processed, and when this process is completed, the counter is returned to the initial value, the next task is processed, and the task returns to the top task. A data processing method characterized in that a task with a low priority is processed by interrupting the processing of a task with a high priority at a predetermined frequency.