JPH06119188A - Task managing system - Google Patents

Abstract

PURPOSE:To provide technique by which false task processing can be performed at high speed by starting up the minimum required number of tasks in an operating system feasible only single task processing. CONSTITUTION:This system is comprised of a task registration table 1 which registers task information to specify individual task classified by every priority at every task group relating to processing in execution, a task storage part 2 which stores the task in accordance with the task information, an instruction issuing means 3 which issues an execution instruction at every unit by decoding a program 5, and an instruction execution means 4 which refers to the task registration table 1 in accordance with an execution instruction issued from the instruction issuing means 3, and reads out the task registered on the task registration table 1, and executes the task.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a system provided with an operating system capable of executing only single task processing, and in particular, to speed up the processing when performing pseudo multitask processing in which a plurality of tasks are processed in parallel. Concerning technology to plan.

[0002]

2. Description of the Related Art In a current operating system (hereinafter abbreviated as OS) of a personal computer or the like, a single-task OS (currently, MS-DOS is mainly used).
Has become commonplace.

When a program is developed under this single task OS, when the program is executed, only a single task can be executed, so that it takes a long time to process.

Therefore, conventionally, a single-task OS is used.
In the above, the following task management method is adopted to perform the pseudo multitask processing. The conventional task management system is a system in which, for each process of a program, the tasks required for executing the process are grouped in advance.

A detailed description of this will be given below. Figure 9
FIG. 10 is a block diagram showing a configuration of a conventional task processing system, which includes an instruction issuing unit 100, an instruction executing unit 110, a task storage unit 120, and a processing program 100a.

The instruction issuing unit 100 includes a processing program 10
When 0a is decoded and the processing program 100a is executed, an execution instruction is issued for each processing unit.
The instruction execution unit 110 executes the instruction issued by the instruction execution unit 100 in processing units.

The task storage unit 120 stores necessary tasks in groups for each processing unit. A specific example of this is shown in FIG.

Here, the instruction issuing unit 100 specifies a process related to program execution by a process identification flag. For example, a task for executing arbitrary processing
If task A, task D, task E, task H, and task J, a flag "1" is added to these task groups, and the instruction issuing unit 100 sends a flag "to the instruction executing unit 110".
When "1" is notified, the instruction execution unit 110 accesses the task storage unit 120 and reads the task group corresponding to the flag "1", that is, the tasks A, D, E, H, and J. The instruction execution unit 110 executes a part of the task A, executes the part of the task D to execute a part of the task D in order to perform the pseudo parallel processing of the task A, the task D, the task E, the task H and the task J. After the execution, the task E is started and a part of the task E is executed, then the task H is started and a part of the task H is executed, and further, the task J is started and a part of the task J is executed. Here, the switching of the execution of each task is performed by the fixed time measured by the timer, that is, after the task A is executed within the fixed time measured by the timer, the task D is similarly executed for the fixed time. Task E
In the same manner, a fixed time is measured, and task H and task J are also executed within the fixed time measured by this timer. Then, these processes are repeatedly performed until all processes related to each task are executed, and the tasks A, D, E, H, and J are pseudo-processed in parallel.

[0009]

By the way, in the above-mentioned task management system, it is necessary to execute a task for a certain period of time and then activate the task to be executed next. That is, there is a problem in that task activation must be performed at regular time intervals measured by a timer, and an extra time is required to execute an arbitrary process. Also, the user needs to divide the group into groups in advance and register the tasks,
It takes time and effort.

Therefore, the present invention has been made in view of the above problems, and an object of the present invention is to provide a task management system capable of performing pseudo task processing at high speed by activating a minimum required number of tasks.

[0011]

The present invention has the following features to attain the object mentioned above. This will be described based on the principle diagram of FIG.

In the task management system according to the present invention, an arbitrary program 5 is divided into processing units, and a task group corresponding to each processing is executed serially in a single task system, a task registration table 1, a task storage unit 2, It is composed of an instruction issuing means 3 and an instruction executing means 4.

The task registration table 1 is for registering, for each task group, task information for specifying individual tasks by priority order. The task storage unit 2 stores the task body corresponding to the task information registered in each task registration table 1.

The instruction issuing means 3 issues a program 5 execution instruction for each processing. The instruction executing means 4
The execution instruction issued by the instruction issuing means 3 is analyzed, the task registration table 1 corresponding to this execution instruction is referenced, and the task corresponding to the task information registered in this task registration table 1 is searched for in the task storage unit 2 It is read from and executed.

Here, the task registration table 1 may be composed of a plurality of tables according to priorities. For example, a high-level task registration table that registers high-level tasks in descending order of priority, a middle-level task registration table that registers middle-level tasks,
You can register tasks by dividing them into a low-level task registration table that registers low-level tasks.

Further, a task registration means 6 for registering an arbitrary task in the task registration table 1 may be provided. Further, task erasing means 7 for deleting arbitrary task information from the task registration table 1 may be provided.

[0017]

According to the present invention, the instruction issuing means 3 divides the program 5 into processing units, and when executing each processing unit,
Issue an execution instruction corresponding to an arbitrary process.

Upon receiving the execution instruction issued by the instruction issuing means 3, the instruction executing means 4 accesses the task registration table 1 corresponding to the processing and reads out individual task information according to the priority order. Then, the task storage unit 2 is accessed based on the individual task information, and the task corresponding to the task information is read and executed.

As a result, the tasks are executed based on the priority order, so that the task with the higher priority order is activated more than the task with the lower priority order, whereby the task processing can be performed efficiently and at high speed.

When the task registration table 1 is composed of a plurality of tables according to priority order, the instruction executing means 4 accesses the table with the lowest priority order, and arbitrarily obtains single task information from this table. Detect and execute the task corresponding to this task information.

After executing the task registered in the lowest table, next, one arbitrary task registered in the table with the lower priority is executed. When this operation is repeated and the task registered in the table with the highest priority is executed, the tasks registered in this table are sequentially executed, and the task registered in this highest table is executed. Perform all.
And then access the table with the highest priority,
Sequentially execute all tasks except the previously executed task. When this operation is repeated and all the tasks registered in the table with the next lowest priority are finished executing, the previously executed task among the tasks registered in the lowest table is executed again. Execute the excluded tasks sequentially.

As a result, a large number of high-priority tasks can be activated and the processing can be executed with the minimum required number of activations. Further, when the user inputs a registration request of an arbitrary task to the system, that is, when the task designation information to be registered and the priority information of the task are input, the task registration means 6 determines the task from the registration request. It is possible to detect the priority order, register the task information specifying the task in the task registration table 1 corresponding to the priority order, and store the task in the task storage unit 2.
As a result, the user can determine the priority order of any task, and can select the priority order based on the program to be processed.

When the user inputs an erasing request for erasing the registered task, the task erasing means 7 recognizes the address information of the task to be erased from the erasing request and the address information. Based on the above, the task registration table 1 is searched to access the area corresponding to the address information, the task information registered in this area is erased, and the task storage unit 2 is accessed based on this task information. Then, the task corresponding to the task information can be deleted. This can prevent unnecessary task activation.

[0024]

EXAMPLES Specific examples of the present invention will be described below. The task management system according to this embodiment includes a processing device 8, a main storage device 9, an input device 10, and a display device 11.

The main memory 9 contains a program 9a to be executed by the processor 8, a task registration table 9b, and a task storage 9c. The task registration table 9b is
This is a table that is provided for each process of the program 9a and registers the tasks necessary for executing an arbitrary process by priority order. Actually, the task data that specifies each task is registered. This detailed description will be given later.

The task storage unit 9c stores the program 9 described above.
a) All tasks required for execution are stored by address. On the other hand, the processing device 8 includes an instruction issuing unit 8a, an instruction executing unit 8b, a task registering unit 8c, and a task deleting unit 8d.

The instruction issuing unit 8a decodes the program 9a in processing units and issues an execution instruction for executing arbitrary processing. The instruction executing unit 8b is the instruction issuing unit 8
Based on the execution instruction issued from a, the task registration table 9b corresponding to the process to be executed is accessed, and the tasks are sequentially activated and executed based on the priority order of the task registration table 9b.

The task registration unit 8c is the input device 10 described above.
When a task registration request is input to the task registration table 9b, the task data specifying the task based on the registration request is registered in the task registration table 9b, and the detailed description thereof will be described later.

The task deleting unit 8d is the input device 10 described above.
When a task deletion request is input to the task registration table 9b, the task data that specifies the task based on the policy request is deleted from the task registration table 9b. This detailed description will be given later.

The display device 11 displays the task number to be assigned to the task when the task is registered. Next, FIG. 3 shows a concrete example of the task registration table 9b in this embodiment.

In this embodiment, the task registration table 9
b is divided into three levels of priority. In the figure,
The task registration table 9b includes an H (; High) level table 12 for registering the highest priority task, an L (; Low) level table 14 for registering the lowest priority task, and the H level table 12. It is composed of an M (; Middle) level table 13 for registering a task having a lower priority and a higher priority than the L level table 14.

The maximum number of task heads stored in the header portion of each table indicates the number of task data stored in the table. Further, in the task registration table 9b, the task itself is not registered, but the task data for identifying each task is registered. The contents of this task data are shown in FIG.

The task data in this embodiment is data consisting of task head information, task status information, user transaction information, and task number, and task head information is an address where a task exists in the task storage unit.

The task status information is information indicating the current task status by a flag, and the flag "0" indicates that the task is being executed.
“1” indicates that the task is on standby, and “2” indicates that the task is stopped.

While waiting, any task registration table 9b
Shows the state registered in, and shows the state that can be activated.
While stopped, it is registered in the arbitrary task registration table 9b, but cannot be activated. That is, when an arbitrary task is unnecessary for the processing to be performed next, the flag "2" is set for the task, so that the instruction execution unit 8b
Skips and does not read the task data when reading the task data. Therefore, it is possible to save the trouble of registering / deleting the task for each process.

The user transaction information stores additional information necessary for executing the task corresponding to the task data. For example, when the task is a numerical calculation process, an arbitrary numerical value is stored in this user transaction, and when the task is executed, this numerical value is substituted to perform numerical calculation.

The task number is the task registration table 9
It is a serial number (sequence number) of the task registered in b. In addition, the user can arbitrarily register the tasks in the above tables. This detailed description will be given later.

In this embodiment, the task registration table 9
When performing processing based on b, the instruction execution unit 8b executes the task d which is the highest address of the L level table 14, and then the task C registered at the highest address of the M level table 13. To do. Then execute task A registered at the highest address of the H level table,
After that, the task B, the task F, and the task G are executed, and after all the tasks registered in the H level table 12 are executed, the task registered in the next highest address by referring to the M level table 13 Execute data E. Then, after executing all the tasks of the H level table 12 again, the M level table 13 is referred to. At this time, since all the tasks registered in the M level table 13 have been completed, the task returns to the L level table 14 and executes the task H registered in the next highest address, and then The same operation is repeated.

FIG. 5 shows the task storage unit 9 in this embodiment.
It is a figure which shows the specific example of c. This figure is a diagram corresponding to FIG. 3 described above, and stores nine tasks A to I. The address in this task storage unit is stored as the task head information. For example, task A
The task data of “1” contains the address “01” as task head information, and the task data of the task B contains “02” as the task head information.

Next, the task registration section 8c in this embodiment.
The operation process of will be described with reference to the flowchart of FIG. When the user inputs a task registration request from the input device 10, the task registration unit 8c recognizes the request (step 601), and the task address information (task head information) to be registered from the task registration request and the task thereof. The priority information of is detected (step 602).

Next, the maximum number of task heads is detected from the task registration table corresponding to the priority information, and task data related to the task is registered in the area obtained by adding 1 to this maximum number of task heads (step 603). ). Here, among the task data, the user transaction information is input by the user from the input device 10. Further, when the task is not used in the next process, it is possible to input the flag "2" as the task status information.

After completing the registration of the task data, the task registration unit 8c increments the maximum number of task heads in the task registration table by "1" (step 604).
Further, a task number is assigned to the registered task (step 605) and this task number is displayed on the display device 11.
Is displayed on the screen and the user is notified of the task number of the task (step 606).

FIG. 7 shows the task deleting section 8 in this embodiment.
It is a flowchart figure which shows the operation process of d. In the present embodiment, when the user inputs a request to delete an arbitrary task, that is, the task number of the task to be deleted, the task deletion unit 8d recognizes the request (step 701), The task number of the task to be deleted is detected from this request information (step 702).

Next, the task deletion unit 8d searches each task registration table 9b based on the task number (step 703) and deletes the corresponding task data from the task registration table 9b (step 704).

Then, the task registration table 9b has a deviation in the task numbers due to the deletion of the task data.
On the other hand, the task number is reassigned (replaced) (step 705) and the maximum number of task heads in the task registration table 9b is decremented by "1" (step 706).

From the above, the user can arbitrarily determine the priority order of individual tasks according to the program to be executed, and can register only the minimum required tasks.

The operation process of the task management system in this embodiment will be described below with reference to the flowchart of FIG. In the task management system of this embodiment, the instruction execution unit 8b has an H level counter, an M level counter, and an L level counter.
A level counter (not shown) is provided.

Each of the counters is incremented by "1" every time the task is activated in each level table, and the instruction executing section 8b executes the task in the area corresponding to the counter value. For example, when the value of the M level counter is "1", the task C stored in the area of the task head "1" of the M level table 13 is executed, and M
When the value of the level counter is "2", the task E stored in the task head "2" area of the M level table 13 is executed.

The task management system in this embodiment is
The instruction issuing unit 8a decodes the program 9a into each processing unit and issues an arbitrary processing execution instruction (step 80).
1). Then, the instruction execution unit 8b that has received the execution instruction accesses the task registration table 9b corresponding to this execution instruction (step 802), and then the H level counter, M
The values of the level counter and the L level counter are set to "1" (step 803).

Next, the instruction execution section 8b accesses the L level table 14 (step 804), reads the maximum number of task heads of this L level table 14, and compares this value with the value of the L level counter (step S804). Step 80
5).

If the L level counter value is less than the maximum number of task heads, the instruction executing section 8b recognizes the task data in the area corresponding to the L level counter value. That is, it is recognized whether or not the storage address information of the task to be executed and the stop flag "2" are set, and whether or not the additional information for the task is registered, and based on these information, the task storage unit is recognized. The task is detected from 9c and executed (step 806).

After the execution of the task of the L level, the instruction executing section 8b accesses the M level table 13 (step 807), and the value of the M level counter and M
The maximum number of task heads in the level table 13 is compared (step 808).

Here, when the M level counter value is less than the maximum number of task heads, the instruction executing section 8b accesses the area corresponding to the M level counter value and based on the task data stored therein. The task to be executed is detected from the task storage unit 9c and executed (step 80).
9).

Further, the instruction executing section 8b accesses the H level table 12 after the execution of the M level task (step 810), and obtains the maximum number of task heads of this H level table 12 and the value of the H level counter. The comparison is made (step 811).

Here, when the value of the H level counter is less than the maximum number of task heads in the H level table 12, the instruction executing section 8b executes the task based on the task data in the area corresponding to the H level counter value. A task to be performed is detected from the task storage unit 9c and executed (step 81).
2).

Here, the instruction executing section 8b increments the value of the H level counter by "1" (step 81).
3), the processing from step 811 above is repeated. Then, when the value of the H level counter reaches the same value as the maximum number of task heads, the value of the M level counter is incremented by "1" (step 814), and the above step 808 is performed.
The subsequent processing is repeated.

Further, when the value of the M level counter reaches the same value as the maximum number of task heads of the M level table 13, the instruction executing section 8b changes the value of the L level counter to "
1 "is incremented (step 815), the processes of step 805 and thereafter are repeated, and when the value of the L level counter reaches the same value as the maximum number of task heads of the L level table 14, the execution instruction is ended. .

As described above, according to the present embodiment, it is possible to arbitrarily set the priority order of tasks according to the program, and it is possible to activate more tasks having higher priority orders.

[0059]

According to the present invention, in a system for performing single task processing, it is possible to perform high speed processing of a program by activating a minimum required number of tasks.

[Brief description of drawings]

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

FIG. 2 is an overall configuration block diagram of a task management system according to this embodiment.

FIG. 3 is a specific example of a task registration table in this embodiment.

FIG. 4 is a specific example of task data in this embodiment.

FIG. 5 is a specific example of a task storage unit in this embodiment.

FIG. 6 is a flowchart showing an operation process of a task registration unit in this embodiment.

FIG. 7 is a flowchart showing an operation process of a task deletion unit in this embodiment.

FIG. 8 is an operation flowchart of the task management system according to this embodiment.

FIG. 9 is a configuration block diagram of a conventional task management system.

[Fig. 10] Internal configuration diagram of a conventional task storage unit

[Explanation of symbols]

 1 ... task registration table 2 ... task storage unit 3 ... instruction issuing unit 4 ... instruction execution unit 5 ... processing program 6 ... task registration unit 7 ... task erasing unit 8 ... processing unit 8a ... instruction Issuing unit 8b ... Instruction execution unit 8c ... Task registration unit 8d ... Task deletion unit 9 ... Main storage device 9a ... Program 9b ... Task registration table 9c ... Task storage unit 10 ... Input device 11 ... Display device 12 ... H level table 13 ... M level table 14 ... L level table

Claims (4)

[Claims] 1. A single-task system in which an arbitrary program (5) is divided into processing units and a task group corresponding to each processing is executed serially, in which task information specifying individual tasks is provided for each task group. A task registration table (1) that registers by priority, a task storage unit (2) that stores a task body corresponding to the task information, and the program (5) that is decrypted in processing units and executed for arbitrary processing. An instruction issuing means (3) for issuing an instruction and a task registration table (1) corresponding to the execution instruction issued by the instruction issuing means (3) are referred to, and tasks registered in the task registration table (1) are referred to. An instruction executing means (4) for reading out and executing a task main body corresponding to information from the task storage part (2), wherein the instruction issuing means (3) The program (5) is decoded and an execution instruction is issued for each processing unit, and the instruction execution means (4) refers to the task registration table (1) corresponding to the execution instruction and refers to the task registration table (1). Recognizing the priority order of the task information and individual task information registered in, the task corresponding to each task information according to this priority order is stored in the task storage unit (2).
A task management method characterized by reading from and executing. 2. The task registration table (1) is composed of a plurality of tables according to priorities, and the instruction execution means (4) executes each task stored in a table with a low priority. The task management system according to claim 1, wherein a plurality of tasks stored in a table with a high priority are executed. 3. A task registration means (6) for registering an arbitrary task in the task registration table (1) is provided, and when the task registration means (6) recognizes a task registration request, the task registration request is issued. Detecting the priority order of the task from the above, registering the task information specifying the task in the task registration table (1) corresponding to this priority order, and storing the task in the task storage section (2). The task management system according to claim 1, which is characterized in that. 4. A task erasing means (7) for erasing arbitrary task information from the task registration table (1) is provided, and the task erasing means (7) is provided when the task information erasing request is recognized. The address information of the task to be erased is recognized from the erase request, the task registration table (1) is searched based on this address information, the area corresponding to the address information is accessed, and the area is registered in this area. 2. The task management system according to claim 1, wherein the task information is erased and the task corresponding to the task information is erased by accessing the task storage unit (2) based on the task information.