JPS60181935A - Task processing controlling system - Google Patents

Abstract

PURPOSE:To execute an equal service of each task, even in case a processing for occupying a running time of other task, such as a batch processing routine, by constituting so that a skip designation can be executed to each task shown by a task queue table. CONSTITUTION:A request from TSS terminals 31-33 is informed to a system control part 13, and assigned to memory spaces 36-38 on a main memory 2 corresponding to each terminal which has been requested, by starting a space control part 12. Subsequently, a processing task program inputted from each terminal is loaded to the respective memory spaces. Next, the system control part 13 starts a slice task 15, sees a task sotred in the memory space, and registers an executable task in a task queue table 16. By a generation of this queue table 16, the slice task 15 executes a time division processing of each task.

Description

[Detailed Description of the Invention] (a) Technical Field of the Invention The present invention relates to a task processing control system, and in particular, enables efficient processing of each task when multiple tasks are executed in parallel. Concerning task processing control methods.

(bl) Conventional technology and problems For example, in a time-sharing processing system (FSS), multiple
” Tasks requested by SS terminals are executed in parallel. This is achieved by a method such as allocating time for executing tasks corresponding to each terminal at regular intervals for each task.

FIG. 1 is a diagram showing the operation of executing tasks corresponding to each terminal in a conventional T''SS system.

As shown in the figure, "rsss tasks running at the same level are generally conversation processing routines (tasks A/, B/).

It consists of a batch processing routine (task A) and a batch processing routine (task A). The conversation processing routine is T S
This is a process in which an operator at an S terminal performs data input operations in a conversational manner with a central computer. A batch processing routine is one that takes several minutes or more during a conversation, and includes processing such as outputting a list to a printer or the like or searching a data base.

Therefore, conventionally, the batch processing routine A2゜A3 of terminal A
When the batch processing routine Cλ of terminal C is being executed, the response of other tasks becomes poor. That is,
This has the drawback that the response of the terminal center executing the conversation processing routine becomes slow and the waiting time for the operator's operations increases.

(C) Purpose of the Invention The purpose of the present invention is to eliminate the above-mentioned drawbacks of the conventional technology by providing a process for each task even when there is a process that occupies the running time of another task, such as a batch processing routine. The purpose of the present invention is to provide a task processing control method that enables uniform service.

(dl Structure of the Invention In order to achieve the above object, the present invention is configured so that each task shown in the task queue table can be designated as skip, and tasks that occupy the running time of other tasks, such as batch processing routines, etc. In this case, the number of times the execution right is passed is not reduced.The present invention will be described in detail below using examples.

(el Embodiment FIG. 2 is a diagram showing an example of a task processing system to which the present invention is applicable, and FIG. 3 is a diagram showing an example of the present invention.

In the figure, common parts are given the same reference numerals, and 1 is a central processing unit (hereinafter referred to as CPU), 2 is a main memory, 3.4 is an input/output control device, 5 is a disk control device, and 31° 32, 33. 41, 42. - are TSS terminal devices, which are equipped with a data input section such as a keyboard and a display section for displaying messages, etc., 41, 42. -- are printers, terminal devices 31, 32 . 51 and 52 are disks which store each task program or data input section managed by the system. In FIG. 3, numeral 11 is a monitor section, which may be considered as O8 executed by CPU I. 12 is a space control unit that allocates spaces 36 to 38 in the main memory 2 to terminal devices 31 to 33 that have received processing requests such as LOG ON, etc.
14 indicates a system control unit, 14 indicates an input/output control unit, and 15 indicates a slice task.

The slice task 15 is also called a switcher, etc., and has a task/queue table 16, which will be described later, and is connected to each terminal device 3.
1 to 33 perform a process of sequentially passing control to the task being executed (that is, causing the CPU 1 to execute the task). On the other hand, tasks requested by each terminal device are stored in the memory spaces 36 to 38 of each terminal device 31 to 33, respectively allocated by the space control unit 12. Each task is loaded from disk 51 or 52. This embodiment employs a multi-task method in which a plurality of tasks are prepared for each terminal device. Furthermore, the task for each terminal device is one that executes one task for the terminal device.

FIG. 4 shows a specific example of the task queue table 16 managed by the slice task 15. This table includes a plurality of types of task queue terminals 16a and a plurality of task control blocks 16b connected to the queue terminals 16a.

It consists of 16c, 16d, and. The queue terminal 16a and each control block 16b, - are provided in a work area on the main memory 2 where the slice task 15 is stored. Queue terminal 16 shown in the figure
A is used to queue tasks in an executable state (ready state), and a queue terminal for queuing non-executable tasks is also provided. This queue terminal 16a includes queued task control blocks 16b,
Start address information 11a of the first block of ---
SQ-ADD, starting address information EQ of the last block
-ADD, an area for storing the number N of blocks, etc. is provided.

On the other hand, each queued task/con1-role/
The blocks 16b, 16c, 16d, - have a start address 5-ADD of the main memory 2 where programs for the corresponding tasks are stored.

Areas are provided to respectively store the end address E-ADD and save information. (In FIG. 4, these information areas are shown only in task control block 16b, but other blocks 16c.

d). Among these, the save information storage area stores various register information, etc. during execution of the corresponding task, each time the slice task 15 transfers the C control right to each task, as will be described later. It is. Furthermore, in this embodiment, each block 16b, c, d is provided with a skip count table for specifying skipping of the task.

This skip count table shows whether the skip specification is enabled or not.
A flag F for setting invalidity to 1, a setting area for setting the MAX number of skips, and a skip number counter C0NT for setting the current number of skips to 1 are provided.

The operation of the embodiment system will be described below based on the operation flowchart of the slice task 15 shown in FIG.

First, a LOC; ON request for each Fss terminal 31 to 33 is notified to the system control unit 13 via the input/output control unit 14.The system control unit 13 starts up the space control unit 12, and each requested Memory spaces 36 to 38 on the main memory 2 corresponding to the terminals 31 to 33 are allocated, and a task program corresponding to the processing input from each terminal 31 to 33 (for example, file search, database, etc.) is It is loaded into memory spaces 36 to 38 corresponding to each terminal.

These task programs are loaded from the disk 51, for example. For convenience, as shown in FIG. 1, tasks A, -A,
? , Task B7. Assume that task C/.C2 is loaded. It goes without saying that these 1'SS tasks for each terminal may be the same task or completely different tasks.

When the memory space allocation and task loading for each terminal are completed, the system control unit 13 executes the slice task 1
Start 5. The slice task 15 first looks at each task stored in the memory spaces 36 to 38 corresponding to each terminal, and
A task queue table 16 showing executable tasks shown in FIG. 4 is created. In the case of FIG. 1, first, the task AI is in the block 16b.Bron'? Various information regarding tasks B, C, is set in 16c and 16d, respectively. In this case, each task ~,B/.

Since c and c are the same Hell's conversation processing routine,
The skip designation flag F is set to be invalid (for example, "0"). The setting of the flag F may be performed by the slice task 15 itself by checking the processing content of each task, or may be performed by programming information instructing the setting of the flag F in each task in advance.

By creating this queue table 16, the slice task 15 executes the time-sharing processing of each task shown in FIG.

That is, the slice task 15 is the first task control block 16b queued in the executable task queue terminal 16a of the key table 16.
See. FIG. 4 (in case of al, block 16b
Refer to the information regarding task A/ stored in . As mentioned above, since there is no skip instruction for task At, slice task 15 directly passes control to task A/ (
That is, execute the process of task A/). After the slice task 15 has executed the task for a certain period of time, the slice task 15 transfers control to task A.
/ Don't pass it from. At the same time, various information regarding task A, whose execution has been aborted, is stored in the evacuation information area.
As shown in bl, the block 16b is connected to the lower part of the queue table.

Then, the slice task 15 refers to the information regarding task B/ stored in the next block 16C, and executes task B/.
, will be executed. Thereafter, task C/ is executed in the same way, and each task A7 to C/ is executed in parallel.

On the other hand, as shown in FIG. 1, assume that task A, which is a batch processing routine, is started on terminal A. Slice task 1
5 assigns this task A to the task control block 16b of the executable task queue terminal 16a.
2. Cent various information regarding 2. Note that task A/ that was queued in block 16b is queued to an unexecutable task queue terminal (not shown). newly queued) task A.

Since this is a batch processing routine that occupies the running time of other tasks as described above, the skip designation flag F is set to be valid (for example, "1"). Furthermore, the number of skips MAX in the number of skips table is determined by the number of skips (MAX) that matches the number of tasks, depending on the number of executable tasks.
For example, rlOJ) is set by the slice task 15. Along with this setting of the number of skips MAX, the number of skips MAX is also set as an initial value in the counter C0NT.

Thereafter, the slice task 15 refers to the blocks of each task (tasks Az, B7.C/ in this case) queued in the executable queue terminal 16a, and sequentially passes control to them at regular intervals.

However, for task A9, since the flag F indicates skip designation, the control right assignment to the task is skipped until the counter C0NT reaches 10''. That is, in this example, task A2 is skipped 10 times, and other tasks B/ and C/ are executed preferentially. Skip counter c.

NT is subtracted by "1" for each skip. When the counter CON T reaches rOJ, the slice task 15 returns the value of the counter C0NT to the set value MAX, and passes control to task A. That is, task A is given control rights that are assigned by the slice task 15 at regular intervals once every 10 times.

When the slice task 15 completes the batch processing of task A2 (that is, when returning to task A/ in FIG. 1), the slice task 15 resets the value of the skip count MAX for task A9 to "0". In other words, the MAX number of skips is
Depending on the number of active tasks, it is set at the beginning of task A and reset at the end of task A. When the slice task 15 sets the skip designation flag F, this flag F is also cent/reset together with the skip count MAX.

As described above, in this embodiment, when conversation processing and batch processing are executed in parallel, processing can be performed with the execution level of batch processing apparently lowered.

Therefore, it is possible to smoothly process each task without reducing the responsiveness of the TSS terminal that is executing conversation processing.

(fl) Effects of the Invention As described above, according to the present invention, it is possible to equalize the services to each task executed in parallel, and it is possible to improve the processing efficiency of the entire system.

Note that the term "task" as used in the present invention refers to a group of programs consisting of a plurality of skips for the CPU to execute one process. Therefore, it goes without saying that a so-called routine (main routine, subroutine) or a program group of one processing unit called a job is regarded as one task.

[Brief explanation of drawings]

FIG. 1 is an explanatory diagram showing how multiple TSS tasks are executed in parallel, FIG. 2 is a diagram showing an example of a task processing system to which the present invention is applied, and FIG. 3 is an embodiment of the present invention. FIG. 4 is a diagram showing a specific example of the task queue table 16 in the embodiment, and FIG. 5 is a flowchart showing the operation of the embodiment. 1 is a central processing unit CPU, and 2 is a main memory. 15 is a slice task, and 31 to 33 are TSS terminals. Reference numerals 41 and 42 indicate printers, and 51 and 52 indicate disk devices, respectively. Figure 1 Figure 2 Figure 4 Flash 5

Claims (1)

[Claims] In a task processing system that includes a queue table in which information indicating a plurality of tasks to be executed is stored, and a task processing unit that executes a predetermined task based on the contents of the queue table, each task shown in the queue table is A task processing control method characterized by providing a skip specifying means for temporarily skipping the execution of the task in units of tasks, and determining whether or not the task processing section can execute each task according to the specification information of the skip specifying means. .