JPH08328879A - Task management system - Google Patents

Abstract

PURPOSE: To provide a task management system of real-time OS which is used for a built-in microcomputer and can improve the task insertion processing speed without increasing the memory capacity. CONSTITUTION: This system consists of an inserting position retrieval means 101 which retrieves a task inserting position, an insertion method decision means 103 which decides a pattern based on the absolute address information 102 showing the head address, the idle area address and the task insertion address and then decides a task insertion method, and a task insertion means 104 which inserts a task based on the insertion method decided by the means 103. Then the means 103 includes a present task number calculation means 105 which calculates the number of present tasks stored in a queue, a queue state analysis means 106 which decides 3 patterns based on the state of the queue, and a direction decision means 108 which decides the task shift direction in the queue based on the information 102 and the half value 107 of the present task number calculated by the means 105.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a task management system,
In particular, the present invention relates to a task management method applied to a real-time OS used in a field in which requirements such as memory capacity or processing speed are severe.

[0002]

2. Description of the Related Art Conventionally, in a product to which an embedded microcomputer is applied, it is necessary to introduce a real-time OS into the software of the application product when the hardware configuration is relatively simple and the scale of the program to be controlled is small. It is said that the family name is low. However, with the diversification of embedded microcomputer application products,
There is a need for a real-time OS that has been conventionally used only in the multi-chip world. There is a strong demand for shortening the program development period, creating the program, and reducing the verification cost of the program.
It is recommended to use a structure that is easy to make and easy to inspect and maintain. For this reason, methods such as program componentization are being adopted. However, in an embedded microcomputer, R which can be used
The resources such as the OM / RAM capacity are still limited, and the processing time occupied by the OS is greatly limited due to the characteristics of the programs that are often used for control.

In response to such a situation, a real-time OS used in an embedded microcomputer is required to have a high processing speed without consuming ROM / RAM, which makes the function compact and saves resources. There is a strong demand for efforts and efforts.

First, a general real-time OS task management method currently used will be described. In a general real-time OS, program execution is managed while switching tasks, which are execution units of processing. A queue of tasks waiting for execution is used for this task management. For example, JP-A-5-274163
In Conventional Example 1 taken up in the publication, as shown in FIG. 6, a structure is used in which information on tasks in a waiting state is sequentially linked as a list. As shown in FIG. 6, the head address 601 of the list indicating the address where the information of the task 1 at the head of the queue is stored, the pointer 602 of the next list indicating the address of task 2, and the address of task 3 are set. The next list pointer 603, ..., And the next list pointer 604 are sequentially connected to the next list pointer. Further, in Japanese Patent Application Laid-Open No. 2-17542, there are cases where the queues are arranged in ascending order of the value by the time counter included in the task information.

As a procedure for extracting a required task from these queues, Japanese Patent Laid-Open No. 4-219830 discloses one conventional example. In this procedure, as shown in FIG. 7, first, the searching means 701 searches for the target task from the head of the queue, and then the selecting means 702.
, The task found as a result of the search by the search means 701 is deleted, and the rearrangement means 703
The chain structure of the queue after the deletion is reconnected. In this case, when adding new task information, the same procedure is performed, the search means 701 searches for a position to be inserted, the selecting means 702 inserts a new task, and the rearranging means 703. The chain structure of the queue after the insertion is reconnected.

Next, how the conventional example 1 is realized by a real-time OS for an embedded microcomputer will be described. In a general real-time OS, the queue is formed by a chain structure using pointers as described above. this is,
This is because there is an advantage that task information as an element can be easily inserted / deleted in the queue. On the other hand, as described above, in a real-time OS for embedded microcomputers, how to suppress the use of resources is important, so the number of queues to be handled becomes small (about 6 to 8 at most), The amount of information stored is also small. Generally, as the structure of the queue, the memory capacity required for the pointer does not matter when handling a certain amount of large data, but it is used for the pointer when the handling data is small. Area becomes a big influence on the total memory capacity (references:
"Algorithms and data structures for C programmers"
p. 53).

Therefore, when the amount of data to be handled is small or limited, it is better to arrange each task information in an array rather than to form a chain structure having pointers in the queue. Effective for reduction. Further, in the chain structure, a method of securing a necessary memory resource at a necessary time is adopted, but in the embedded microcomputer OS, a method of allocating a necessary area in advance due to the resource limitation described above. Is taken. Also in this respect, when the amount of data to be handled is small or limited, the queue using the array is more RAM.
It can be said that it is efficient. Hereinafter, the one using this arrangement is referred to as Conventional Example 1.

Regarding the example of waiting using the array as described above, referring to FIGS. 8 (a), (b), (c) and (d), the procedure of task insertion in the task management system of the prior art 1 described above. Will be explained. 8 (a), (b), (c) and (d) show the progress of the queue in the task insertion procedure. First, in FIG. 8A, the insertion position of “task1” is sequentially searched from the head address 802 of the queue 801. In this example, it is assumed that the queue 801 has a free area address 803. In FIG. 8B, it is assumed that the insertion address 804 is found to be between the task t ₁ and the task t ₂ as a result of the search, and in FIG. 8C, the task t ₂ after the insertion address 804. , T ₃ , t ₄ and t ₅ are shifted to the rear of the queue 801, and the “task1” is inserted between the task t ₁ and the task t ₂ in FIG. 8D.

In the case of the prior art example 1, since the shift is performed backward regardless of the insertion position of the task,
If there are n tasks in the queue, there is a problem that a maximum of n shift operations are required. 9 (a), 9 (b), and 9 (c) show the progress states of the queue in the task insertion procedure of another conventional example 2 corresponding to the solution of this problem.
And (d). First, in FIG. 9A, the insertion position of "task1" is sequentially searched from the start address 902 of the queue 901, the number of tasks passed in the process of this search is counted, and a predetermined counter (not shown) Stored in. In FIG. 9B, if it is found as a result of the search that the insertion address 904 is between the task t ₂ and the task t ₃ , the number of passing tasks stored in the counter is 2. next,
The number of tasks currently stored in the queue 901 is counted, and the number of half the number is compared with the number of passed tasks stored in the counter.
In (c), the shift is performed to the smaller one, that is, to the front rather than the rear. And FIG. 9 (d)
In the same manner as in the case of the conventional example 1 described above, the "ta
sk1 ″ is inserted between the task t ₂ and the task t _{3. In} the case of the conventional example 2, the number of shifts can be suppressed to n / 2 times on average (reference). Reference: "Algorithms and data structures for C programmers" p.53).

The outline of the configuration of the above-mentioned conventional example 2 is shown in FIG.
It is shown in (a). In FIG. 10A, the conventional example 2 is an insertion position search means 1 for searching the insertion position of a task.
001, the passing task number counting means 1002 for receiving and counting the number of passing tasks at the time of retrieval, and the passing task number 1003 counted by the passing task number counting means 1002, and using the passing task number 1003 Insertion method determining means 10 for determining the insertion method
04 and the insertion method of the task by the insertion method determination unit 1004, the task insertion unit 1 shifts in the direction determined by the insertion method and inserts a predetermined task.
And 005. Then, as shown in FIG. 10B, the insertion method determining means 1004 further calculates the current task number calculating means 1006 for calculating the number of tasks currently stored in the queue and the current task number calculating means 1006. Half the number of current tasks calculated by
When the number of passing tasks 1003 is received, the direction determining means 1008 is configured to determine the shift direction of shifting to the front or shifting to the rear.

Next, the processing procedure of the second conventional example will be described with reference to the flowchart shown in FIG. In step 1102, while the insertion position searching means 1001 searches for the insertion position of the task, if the search is not found yet, in step 1101, the passing task number counting means 1002 passes through the search loop. The number of tasks performed is counted. When the insertion position of the task is found by the insertion position search in step 1102, the number of tasks currently stored in the queue is calculated by the current task number calculation means 1005 in step 1103, and then step 1104 is executed. In, the direction determining means 1008
Count number 1 of the number of passing tasks in step 1101
003 is compared with a value 1007 which is half the number of tasks stored in the queue obtained in step 1103, and in the comparison result, the number of passing tasks is 10
If 03 is larger than the half value 1007 of the current task number, the shift direction is determined backward in step 1106, and the passing task number 1003 is smaller than the half value 1007 of the current task number. If it is smaller, in step 1105 the forward shift direction is determined. In step 1107, task shifting is performed in the direction determined in step 1105 or step 1106, and the desired task is inserted by the task inserting means 1005.

[0012]

In the conventional task management system described above, a real-time OS of an embedded microcomputer is generally required to have a high processing speed without consuming resources such as RAM. It is necessary to make the functions compact and to save the resources used by the OS.

In the case of the conventional example 2, the conventional example 1
However, the processing procedure for counting the number of passing tasks in step 1101 of FIG. 11 is included in the loop of step 1102 for searching for the insertion position, although it has the advantage of reducing the number of shift operations which is a problem in the above. Therefore, there is a disadvantage in that the processing time increases as the number of insertion position searches increases.

Further, there is a drawback that a RAM must be newly added to count the number of passing tasks.

The object of the present invention is to solve the drawbacks of the conventional example 2 described above, shorten the processing procedure for counting the number of passing tasks, and eliminate the need for using RAM.
It is to realize a task management system for S.

[0016]

The task management system of the present invention manages the execution of a plurality of tasks and manages the execution waiting tasks by using a finite array composed of a predetermined queue and an empty area. In the task management method of the real-time OS for performing, when inserting a predetermined task into the queue, an insertion position searching means for searching a position in the queue for inserting the predetermined task into the queue, An insertion method for determining a method for inserting the predetermined task at the task insertion position obtained by the insertion position search means through a predetermined analysis process using the start address of the queue and the start address of the empty area. And a task inserting means for inserting the predetermined task into the queue by the inserting method determined by the inserting method determining means. It is characterized in that.

It should be noted that the inserting method determining means determines the start address of the queue at the present time, the start address of the empty area of the queue, and the task insertion position obtained through the insertion position search by the position searching means. Address of the current task number calculation means for calculating and outputting the number of tasks at the current time stored in the queue, and the current number of tasks obtained by the current task number calculation means. A queue state analysis means for analyzing the current state of the queue to identify a pattern of the queue, identification information of the pattern obtained by the queue state analysis means, and the current task number calculation means Inserting a task into the queue by using a numerical value corresponding to half the number of the tasks calculated by And direction determining means for determining a shift direction may be configured with.

The inserting method determining means may further include a start address of the queue at the present time, a start address of the empty area of the queue, and a task insertion position obtained through the insertion position search by the position searching means. Address of the queue, the queue state analysis means for analyzing the state of the queue at the present time to identify the pattern of the queue, the start address of the queue at the present time, and the free space of the queue. The start address of the area, the address of the task insertion position obtained through the insertion position search by the position search means, the identification information of the pattern obtained by the queue state analysis means, and the predefined queue A method for determining the shift direction of task insertion with respect to the above-mentioned queue by using the value corresponding to half the maximum value and A determination unit may be configured with.

[0019]

Next, the present invention will be described with reference to the drawings. Before the description of the embodiments of the present invention, the state of the queue will be described as a preliminary.

Generally, in the queue, the absolute address indicating the start address of the queue and the start address of the empty area changes due to the insertion / deletion of the task. Due to the positional relationship of the absolute addresses, there are three patterns in the queue 401 as shown in FIGS. 4 (a), (b) and (c). FIG. 4A shows a pattern in which the free area address B (B is an absolute address) 403 is larger than the start address A (A is an absolute address) 402 of the area in which tasks are stored in the queue 401. (Hereinafter, referred to as pattern 1), and FIG.
02 is larger than the free area address B403, and the insertion address C for inserting a task (C is an absolute address)
This is a pattern in which the start address 402 is larger than 404 (hereinafter referred to as pattern 2). Further, in FIG. 4C, a pattern in which the start address A402 is larger than the free area address B403 and the insertion address C404 for inserting the task is larger than the start address 402 (hereinafter, referred to as pattern 3). Is.

In the following description of the embodiments of the present invention,
Focusing on the above three patterns, in the task management system of the present invention, the shift direction can be determined by the task insertion position without counting the number of passing tasks by the counter when searching the task insertion position. An example shall be described.

FIG. 1A is a diagram showing the basic configuration of one embodiment of the present invention. As shown in FIG. 1, in the present embodiment, the above-mentioned three patterns are determined based on the insertion position search means 101 that searches the queue for the position to insert a task and the address information of the absolute address. The task is inserted according to the insertion method determining means 103 for determining the insertion method and the method determined by the insertion method determining means 103 by using the absolute address information 102 indicating the start address, the free area address and the task insertion address of And a task insertion means 104. Also,
FIG. 1B is a diagram showing an internal configuration of the insertion method determination means 103 in the first embodiment of the present invention, and a current task number calculation means 105 for calculating the number of tasks currently stored in the queue. The queue state analysis means 106 for discriminating the above-mentioned three patterns from the state of the queue, the absolute address information 102, and the value 107 which is half the current task number calculated by the current task number calculation means 105 are used. Direction determining means 10 for determining the direction in which to shift the tasks in the
8 is provided.

The operation of the first embodiment will be described below with reference to the flowchart of FIG. First, in step 201, the insertion position search means 101
As a result, the position of inserting the task in the queue 401 is searched. If the insertion position is not found as a result of this search, the process returns to step 201 and the insertion position is searched again. When the insertion position is found in step 201, the current task number calculating means 105 calculates the number of tasks currently stored in the queue 401 in step 202. Then, the queue state analysis unit 106 compares and compares the absolute addresses of the corresponding queues 401 in order to determine which pattern of the three patterns shown in FIG. 4 belongs to. First, in the state analysis 1 of step 203, the head address A402 of the queue 401 and the free area address B403 are compared. In step 203,
Free area address B403 is the start address A of the queue
If it is larger than 402, it is determined that the queue 401 is the pattern 1, and if the head address A402 of the queue 401 is larger than the free space address B403, the queue 401 is the pattern 2 or pattern 3. It turns out that it is either. In this case, in the state analysis 2 of step 204, the queue 401
The leading address A402 of the above is compared with the insertion address C404 of the area in which the task is to be inserted. In this step 204, if the start address A402 of the queue 401 is larger than the insertion address C404, it is determined that the queue 401 is pattern 2, and the insertion address C404 is the start address of the queue 401. Queue 4 if less than A402
It is determined that 01 is pattern 3. For the processing when the queue 401 is empty (A = B),
Since it is a target to be determined and processed before the task insertion process, the description thereof will be omitted.

If it is determined in step 203 that the queue is pattern 1, step 20
In the direction determination 1 of 5, the difference between the insertion address C404 to be inserted and the start address A402 (CA)
Is compared with a value (hereinafter, referred to as D) which is half the number of current tasks stored in the queue 401, and (CA)
Is greater than or equal to D, it is determined in step 209 that the shift direction is backward, and (C-A)
Is smaller than D, it is determined in step 208 that the shift direction is the forward direction. Also,
In step 204, queue 401 has pattern 2
If it is determined that the insertion address C4 to be inserted is determined in the direction determination 2 of step 206.
04 and the free area address B403 (CB), and a value D which is half the number of current tasks stored in the queue 401.
And (CB) is greater than D, it is determined in step 208 that the shift direction is the forward direction, and (CB) is less than or equal to D, In step 209, the shift direction is determined to be backward. Furthermore, when it is determined that the queue 401 has the pattern 3 in step 204, in the direction determination 3 of step 207, the difference (CA) between the insertion address C404 to be inserted and the head address A402 is determined. , The value D, which is half the current number of tasks stored in the queue 401, is compared, and (C
-A) is smaller than D, step 208
In the case where the shift direction is determined to be the forward direction in (1) and (C-A) is D or more, the step 20
In 9, it is determined that the shift direction is backward. However, when the objects to be compared with each other are the same, the shift direction may be determined in any of the front and rear directions, and the shift is normally performed forward. Then, following step 208 and step 209, step 210
In, the task is shifted according to the shift direction determined to be either forward or backward, the task to be inserted is inserted, and the process ends.

In the above-mentioned conventional example 2, step 11
Since the count processing of the number of passing tasks of 01 is included in the search loop, there is a drawback that the processing time increases as the number of searches increases, but in contrast to this,
In the first embodiment, regardless of the number of searches, the state analysis 1 of step 203, or the state analysis 1 of step 203 and the state analysis 2 of step 204 can be used to deal with this, and the time required for the entire process can be reduced. Since it is possible to perform shortening and averaging, and since it is not necessary to count the number of passing tasks, the processing of counting the number of passing tasks in the conventional example 2 and the RAM of the number of passing tasks required for this Area is reduced.

Next, a second embodiment of the present invention will be described. The difference between this embodiment and the first embodiment is the difference in the configuration contents of the insertion method setting means 103 in the configuration of FIG. The insertion method determining means 103 of this embodiment is shown in FIG.
As shown in the above, from the state of the queue,
Queue state analysis means 106 for discriminating a pattern, and a half of the maximum value of the queue defined in advance as a constant 109 and absolute address information 102 are used to shift the tasks in the queue, as will be described later. And a direction determining means 110 for determining a direction. In this embodiment, as is clear from comparison between FIG. 1B and FIG. 1C, the current task number calculating means 10 in the first embodiment is shown.
5 has been deleted. Here, the real-time OS for embedded microcomputers uses a relatively small queue size, and pays attention to the fact that a predetermined area is secured by using an array. Instead of the number of tasks that have been assigned, a value that is half the size of the queue that was originally secured (hereinafter referred to as E) is defined in advance as a constant and used.

The operation of this embodiment will be described below with reference to the flowchart of FIG. First, in step 301, the insertion position search means 101 searches the queue 401 for a position to insert a task. If the insertion position is not found as a result of this search, the process returns to step 301 again and the insertion position is searched. When the insertion position is found in step 301, the queue state analysis means 106 determines the pattern to which the corresponding queue 401 belongs, out of the three patterns shown in FIG. 4, respectively. The absolute addresses of are compared and matched. First, step 302
In the state analysis 1 of 1, the start address A402 of the queue 401 and the free area address B403 are compared. In step 302, the free area address B40
3 is larger than the start address A402 of the queue 401, the queue 401 is determined to be pattern 1, and the start address A402 of the queue 401 is determined.
Is larger than the free area address B403, the queue 401 is determined to be either pattern 2 or pattern 3. In this case, step 3
In the state analysis 2 of 04, the start address A402 of the queue 401 is compared with the insertion address C404 of the area in which the task is to be inserted. This step 30
4, when the start address A402 of the queue 401 is larger than the insertion address C404, it is determined that the queue 401 is pattern 2, and
When the insertion address C404 is equal to or lower than the head address A402 of the queue 401, the queue 401 is determined to be pattern 3.

In step 302, the queue 4
If 01 is determined to be the pattern 1, in the direction determination 1 at step 303, the difference (C
-A) and half the maximum value of the queue 401 (hereinafter,
E) is compared, and if (C-A) is greater than or equal to E, it is determined in step 308 that the shift direction is backward, and (C-A) is greater than E. If it is smaller, it is determined in step 307 that the shift direction is the forward direction. Also, step 30
4 determines that the queue 401 has the pattern 2, in the direction determination 2 of step 305, the difference (CB) between the insertion address C404 and the free area address B403 to be inserted, and the queue 40
The value E, which is half the maximum value of 1, is compared, and the above (CB)
Is larger than E, it is determined in step 307 that the shift direction is the forward direction, and (C-
If B) is equal to or less than E, it is determined in step 308 that the shift direction is backward. Furthermore, when it is determined that the queue 401 has the pattern 3 in step 304, in the direction determination 3 of step 306, the difference (CA) between the insertion address C404 to be inserted and the head address A402 is determined. ,
The value E, which is half the maximum value of the queue 401, is compared, and if (C−A) is smaller than E, it is determined in step 307 that the shift direction is the forward direction.
If (CA) is equal to or larger than E, it is determined in step 308 that the shift direction is the backward direction. When the comparison targets are equal to each other, the shift direction may be determined in any of the front and rear directions, and normally, the shift is performed forward. Then, following step 307 and step 308, step 309
In, the task is shifted according to the shift direction determined to be either forward or backward, the task to be inserted is inserted, and the process ends.

Next, as a concrete example of the direction determination in the second embodiment, the maximum value of the queue is set to 8 and FIG.
The case of the queues shown in (a), (b) and (c) will be described. In the case of the pattern 1 shown in FIG. 4A, the value of (C-A) is 2, which is smaller than the value E of 4, so the shift direction is forward. In the case of the pattern 2 shown in FIG. 4B, the value of (C-B) is 2, which is smaller than the value of 4 of E, so the shift direction is backward. Then, in the case of the pattern 3 shown in FIG. 4C, the value of (C-A) is 2, which is smaller than the value of E, 4, so the shift direction is forward.

By adopting this second embodiment, the conventional example 2
The calculation process of the number of tasks currently stored (step 1103 in FIG. 11), which is performed in
The processing time can be shortened. However, this second
In this embodiment, since the size of the entire queue that is reserved in advance is used instead of the number of tasks actually stored, when the number of stored tasks is small, the first The number of tasks to be shifted may increase as compared with the case of the embodiment. As in the above example, when the maximum number of tasks that can be stored in the queue is eight, an example in which the number of tasks to be shifted increases depending on the insertion position is shown in the table of FIG.

In the table of FIG. 5, the upper part shows the shift direction and the number of tasks to be shifted (column P) in the second embodiment (column Q), and the lower part shows the first embodiment. It shows the shift direction and the number of tasks to be shifted (column R) (column S). The shaded area in the table is
The first and second embodiments show the case where the number of shifts is different from each other. For example, if three tasks are stored in the queue and the tasks are inserted between the second and third tasks in the queue, only one task is shifted backward in the first embodiment. While doing
In the second embodiment, the one that shifts two tasks forward is selected. In addition, when four tasks are stored in the queue, and when tasks are inserted between the third and fourth queues, and when five tasks are stored in the queue, The same applies when a task is inserted between the third and fourth positions. This case increases as the maximum number of tasks that can be stored in the queue increases, but as described above, in a real-time OS for embedded microcomputers that uses a relatively small queue of about 6 to 8, Even if the above case occurs, the maximum value of the number of shifts in all cases (in the table of FIG. 5, when seven tasks are stored, the task is inserted between the fourth task and the fifth task). Since the maximum number of processing times does not become longer, the effect of reducing the calculation processing of the number of tasks can be obtained.

As an application example of the present invention, in the processing time measurement example using the 78K / 4 series, when the maximum number of stored tasks is 8 and 7 tasks are stored in the queue, When a task is inserted between the seventh task and the seventh task, the processing time is 35 in the conventional example.
While it was μsec, the processing time can be shortened to 25 μsec when the second embodiment is applied.

[0033]

As described above, according to the present invention, when a task insertion position is searched for a queue, pattern determination is performed through state analysis of the queue, so that the number of searches increases. The effect is that the processing time required for task management can be shortened.

Further, the counting function of the number of passing tasks which has been conventionally used at the time of searching the task insertion position is eliminated,
There is an effect that the addition of the RAM area required for the counting function is completely unnecessary.

Therefore, it is possible to reduce the RAM area used for the real-time OS and to shorten the processing time required for the real-time OS processing corresponding to the embedded microcomputer with limited resources. There is an effect that a general real-time OS can be provided.

[Brief description of drawings]

FIG. 1 is a basic configuration of the present invention and first and second aspects of the present invention.
It is a figure which shows the structure of the insertion method determination means in the Example of this.

FIG. 2 is a diagram showing a flowchart of a processing procedure in the first embodiment of the present invention.

FIG. 3 is a diagram showing a flowchart of a processing procedure in the second embodiment of the present invention.

FIG. 4 is a diagram showing a queue pattern.

FIG. 5 is a diagram showing a task shift number comparison table in the first and second embodiments of the present invention.

FIG. 6 is a diagram showing a queue of a general real-time OS.

FIG. 7 is a diagram showing a configuration of task management of a general real-time OS.

FIG. 8 is a diagram showing an inserting operation to a queue in Conventional Example 1.

FIG. 9 is a diagram showing an inserting operation to a queue in Conventional Example 2.

10 is a diagram showing a basic configuration of Conventional Example 2 and a configuration of an insertion method determining unit in Conventional Example 2. FIG.

11 is a diagram showing a flowchart of a processing procedure in Conventional Example 2. FIG.

[Explanation of symbols]

 101, 1001 Insertion position search means 102 Absolute address information 103, 1004 Insertion method determination means 104, 1005 Task insertion means 105, 1006 Current task number calculation means 106 Queue state analysis means 107, 1007 Half value of current task number 108, 110, 1008 Direction determining means 109 Half value of maximum value of queue 201, 301, 1102 Insertion position search 202, 1103 Current task number calculation 203, 302 State analysis 1 204, 304 State analysis 2 205, 303 Direction determination 1 206 , 305 Direction determination 2 207, 306 Direction determination 3 208, 307, 1005 Front 209, 308, 1106 Rear 210, 309, 1107 Task insertion 401, 801, 901 Queue 402 402 Start address A 403 Free area address B 404 Input address C 601 List start address 602 Next list pointer (task 1 information) 603 Next list pointer (task 2 information) 604 Next list pointer (task n information) 701 Search means 702 Selection means 703 Sorting means 802, 902 Start address 803, 903 Free area address 804, 904 Insert address 1002 Passing task number counting means 1003 Passing task number 1101 Passing task number counting 1104 Direction determination

Claims (3)

[Claims] 1. A task management system for a real-time OS, which manages execution of a plurality of tasks, and manages tasks waiting to be executed using a finite array composed of a predetermined queue and an empty area. Insertion position searching means for searching a position in the queue for inserting the predetermined task into the queue when inserting the predetermined task into the queue, a start address of the queue and a head of the empty area An insertion method determining unit that determines a method of inserting the predetermined task at the task insertion position obtained by the insertion position searching unit using a predetermined analysis process using an address, and is determined by the insertion method determining unit. And a task inserting unit that inserts the predetermined task into the queue by the insertion method. 2. A task insertion position obtained by the insertion method determining means through the insertion position search by the position search means, the start address of the queue at the current time point, the start address of the empty area of the queue, And the current task number calculation means for calculating and outputting the number of tasks at the current time stored in the queue, and the current number of tasks obtained by the current task number calculation means. A queue state analysis unit that analyzes the current state of the queue to identify the pattern of the queue, identification information of the pattern obtained by the queue state analysis unit, and the current task number calculation unit And a numerical value corresponding to half of the number of tasks calculated and output, Task management method according to claim 1, characterized in that it comprises a direction determining means for determining the winding direction, the. 3. The task insertion position obtained by the insertion method determination means through the insertion address search by the position search means, the start address of the queue at the current time point, the start address of the empty area of the queue, Address of the queue, the queue state analysis means for analyzing the state of the queue at the present time to identify the pattern of the queue, the head address at the present time of the queue, and the free space of the queue. The start address of the area, the address of the task insertion position obtained through the insertion position search by the position search means, the identification information of the pattern obtained by the queue state analysis means, and the predefined queue And a numerical value corresponding to half of the maximum value are used to determine the direction of shifting the task insertion to the queue. Task management method according to claim 1, characterized in that it comprises a means.