JP2611739B2 - Task communication system - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an inter-task communication system which is executed on the same system without using a communication line and requires flow control.

[0002]

2. Description of the Related Art In a conventional inter-task communication system,
When performing flow control, the task on the receiving side performed control.

[0003] For example, as shown in FIG.
1 is a task on the receiving side, and task B 602 and task C 603 are tasks on the transmitting side. Receive queue 60
Reference numeral 4 is provided in the task A and is used when receiving a message transmitted to the task A. Task B
The task queue 605 is used when processing messages transmitted from the task B among the messages connected to the reception queue 604, and the task C queue 606
Is used for processing messages transmitted from the task C among the messages connected to the reception queue 604.

Next, the operation of this conventional inter-task communication system will be described with reference to FIG.

First, task B 602 to task A 601
To send a message to
601 transmits a transmission start request to the task B 602 to urge the task B 602 to transmit. This task B6
02, upon receiving the transmission start request transmitted from the task A601, transmits a message to the task A601. The task A601 is the task B6
02, the task A 601
This received message is linked to the receiving queue in. Here, the reception queue 604 is also connected to another task, for example, a message transmitted from the task C603. Here, when processing the message transmitted from the task B 602, the message is further connected to the task B queue 605, and then the message is taken out by the FIFO and executed.

[0006] Here, when the messages are excessively accumulated in the task B queue 605, the task A 601 requests the task B 602 to temporarily suspend the message transmission. Upon receiving the transmission suspension request from the task A 601, the task B 602 suspends the transmission of the message.

Next, when the messages accumulated in the task B queue 605 are processed to some extent, the task A 601 transmits a transmission restart request to the task B 602 again. When the task B 602 receives the transmission restart request transmitted from the task A 601, the task B 602 restarts message transmission.

[0008]

In the flow control in the conventional inter-task communication, a task of a message transmission destination issues a transmission request to a task of a transmission source, and the task of the transmission source receives the transmission request. After that, the load on the message transmission has increased due to the message transmission.

[0009] Further, since the source task cannot transmit a message unless it receives a transmission request from the destination task, it takes a very long time to perform flow control.

Further, when task division is performed for each layer when the OSI protocol stack or the like is implemented, it is necessary to relay a message between a plurality of tasks and transmit the message.
There has been a problem that this conventional task communication method cannot be executed.

[0011]

In order to solve the above problems, an inter-task communication system according to the present invention is an inter-task communication system for transmitting and receiving a message between a plurality of tasks. A free queue that is connected to a message buffer to be transmitted to transmit a message to a destination task, and a determination unit that determines whether processing of a message transmitted from the source task is delayed in the destination task, The destination task is a normal queue for receiving a message transmitted from the free queue, and a message transmitted from the determined source task when the determination unit determines that processing is delayed. And the message received in the normal queue or the priority queue And a processing unit for processing.

In the case where a message is transmitted from the source task to the destination task via a relay task (relay task), the relay task includes:
A second normal queue for receiving a message transmitted from the free queue, and a second for receiving a message transmitted from the determined source task when the determination unit determines that processing is delayed. , A second processing unit that processes a message received in the second normal queue or the second priority queue, and a relay flag that relays a determination result of the determination unit.

[0013]

Next, a first embodiment of the inter-task communication system of the present invention will be described in detail with reference to the drawings.

FIG. 1 is a block diagram showing a configuration of a communication system between tasks according to a first embodiment.
1 operates on the computer 100 and transmits a message. The destination task 106 operates on the computer 100 to receive a message and perform the processing. Each task performs each process while synchronizing with each other by transmitting and receiving messages. Normal queue 10
2 and 107 are provided for each task and used when receiving a message. The priority queues 103 and 108 are provided for each task.
It is used when receiving a message having a higher priority than a message connected to 02 or 107. The processing unit 111 processes the transmitted message. The free queue 104 is provided in the transmission source task 101, and is connected to the maximum number of message buffers 110 used in the present system and secured in the memory pool 109 managed by the computer 100. Flow flag 10
5 is provided in the source task 101, and the destination task 106 is provided in accordance with the number of unused message buffers 110 remaining in the free queue 104.
To determine if the processing of the sent message in is delayed. That is, the flow flag 105
If N, it indicates that the processing in the destination task 106 is delayed.

Next, the operation of this embodiment will be described with reference to FIGS.
This will be described in detail with reference to FIG.

First, the operation of the source task will be described with reference to the flowchart of FIG.

The transmission source task 101 secures the maximum number of transmission message buffers 110 used in the present system in the memory pool 109 managed by the system in advance, and connects the message buffers 110 to the free queue 104 (S301). ). Further, the flow flag 105 is set to O
Set to FF.

Next, when transmitting a message, the source task 101 removes the message connected to the free queue 104 (S302) and connects it to the normal queue 107 provided in the destination task 106 (S302).
303). Here, messages transmitted from tasks other than the source task 101 are also connected to the normal queue 107.

Further, the source task 101 checks the flow flag 105 (S 304). If the flow flag 105 is OFF, the free queue 104 further has a predetermined amount (for example, ／ of the total). It is checked whether or not it is used (S306), and if it is used, the flow flag 105 is turned ON (S306).
307). In the step S4, if the flow flag 105 is ON, a message connected to the normal queue 107 is searched from the top,
Only one message transmitted from the transmission source task 101 found first is reconnected to the priority queue 108 (S305).

Next, the operation of the destination task will be described with reference to the flowchart of FIG.

When receiving the message transmitted from the source task 101, the destination task 106 first checks whether there is a message in the priority queue 108 (S501). The message at the head of the normal queue 107 is taken (S503). If there is a message in the priority queue 108, the message at the head of the priority queue 108 is taken (S502).

Next, the message received from the normal queue 107 or the priority queue 108 is processed by the processing unit 111 (S504), and then the processed message is transferred to the free queue provided in the source task 101. It returns to S104 (S505).

Further, the number of messages connected to the free queue 104 is checked (S506). If this number is equal to or more than a predetermined amount (for example, 全体 of the total), the flow flag provided in the source task 101 is checked. 105 is turned ON (S507).

Next, a second embodiment of the present invention will be described in detail with reference to FIGS. 2, 3, 4 and 5.

FIG. 2 is a block diagram showing the configuration of the second embodiment. Further, most of the configuration of the present embodiment has the same configuration as that of the above-described first embodiment, and the description of the overlapping portions will be omitted.

The relay task 201 is executed by the computer 100
It operates on the above and receives the message transmitted from the transmission source task 101 and transmits it to the transmission destination task 106. The normal queue 202 and the priority queue 203 are provided in the relay task 201, and the tasks 101, 10
6 has the same function as that provided in the sixth embodiment. The processing unit 205 processes a mess sent by the normal queue 202 or the priority queue 203. The relay flag 204 is provided in the relay task 201, and relays the state of the flow flag 105 provided in the source task 101.

Next, the operation of this embodiment will be described in detail with reference to FIG. 2, FIG. 3, FIG. 4, and FIG.

First, the transmission source task 101 transmits the maximum number of transmission message buffers 110 used in the present system.
In the memory pool 109 under system management in advance,
The message buffer 110 is connected to the free queue 104 (S301). Furthermore, the flow flag 10
5 is set to OFF.

Next, when transmitting a message, the source task 101 removes the message connected to the free queue 104 (S302), and connects the message to the normal queue 202 provided in the relay task 201 (S3).
03). Here, messages transmitted from tasks other than the source task 101 are also connected to the normal queue 107.

Further, the source task 101 checks the flow flag 105 (S 304). If the flow flag 105 is OFF, the free queue 104 further has a predetermined amount (for example, ３ of the total). It is checked whether or not it is used (S306), and if it is used, the flow flag 105 is turned ON (S306).
307). In the step S4, when the flow flag 105 is ON, the message connected to the normal queue 202 is searched from the beginning, and the message transmitted from the source task 101 found first is sent. Only one message is connected to the priority queue 203 (S305).

Next, when receiving the message transmitted from the source task 101, the relay task 201 first checks whether there is a message in the priority queue 203 (S401), and there is a message. In this case, the message at the head of the priority queue 203 is taken (S402). Further, the status of the relay flag 204 is checked (S403), and
If it is FF, it is turned ON (S404). If there is no message in the priority queue 203, the message at the head of the normal queue 202 is taken (S40).
5). Further, the status of the relay flag 204 is checked (S406), and if the relay flag 204 is ON, it is turned OFF (S407).

Next, processing of the message received from the priority queue 203 or the normal queue 202 is performed by the processing unit 205.
(S408), and the relay flag 2
04 (S409). If the relay flag 204 is ON, the message is transmitted to the destination task 1.
06 (S41).
0) If the relay flag 204 is OFF, the connection is made to the normal queue 107 provided in the destination task 106 (S411).

Next, when receiving the message transmitted from the relay task 201, the transmission destination task 106 first checks whether there is a message in the priority queue 108 (S501). If not, the message at the head of the normal queue 107 is taken (S503). If there is a message in the priority queue 108, the message at the head of the priority queue 108 is taken (S502).

Next, processing of the message taken from the normal queue 107 or the priority queue 108 is performed (S50).
4) Then, the processed message is returned to the free queue 104 provided in the source task 101 (S505).

Further, the number of messages connected to the free queue 104 is checked (S506). If this number is equal to or more than a predetermined amount (for example, 全体 of the total), the flow flag provided in the source task 101 is checked. 105 is turned ON (S507).

Further, in the second embodiment, an example has been described in which a message is relayed to one task while the message is transmitted from the source task to the destination task. Obviously, each relay task performs the same operation as that shown in the flowchart of FIG. 4 described above. At this time, the relay flag provided in the relay task relays the state of the flow flag provided in the source task, and thus performs the same function as the flow flag during the relay.

Further, in each of the above embodiments, the source task, the relay task, and the destination task are set in advance for the sake of simplicity of description.
Obviously, it can be a relay task and a destination task.

[0038]

As described above, the inter-task communication system according to the present invention can realize high-speed flow control by performing flow control by the task of the transmission source.
Further, the processing speed of the entire system is improved because the inter-task communication whose processing is delayed is preferentially processed.

In the inter-task communication, a message can be relayed and transmitted to a plurality of tasks. In this case as well, the flow of the task including the task to be relayed by the source task can be performed. Therefore, the speed of the entire system is improved.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a configuration of a first embodiment.

FIG. 2 is a block diagram showing a configuration of a second embodiment.

FIG. 3 is a flowchart illustrating an operation of a transmission source task.

FIG. 4 is a flowchart showing the operation of a relay task.

FIG. 5 is a flowchart showing the operation of a destination task.

FIG. 6 is a block diagram showing a configuration of a conventional inter-task communication system.

[Explanation of symbols]

 REFERENCE SIGNS LIST 100 computer 101 source task 102 normal queue 103 priority queue 104 free queue 105 flow flag 106 destination task 107 normal queue 108 priority queue 109 memory pool 110 message buffer 111 processing unit 201 relay task 202 normal queue 203 priority queue 204 processing unit 205 Relay flag 601 Task A 602 Task B 603 Task C 604 Receive queue 605 Task B queue 606 Task C queue

Claims (3)

(57) [Claims] 1. An inter-task communication system for transmitting and receiving a message between a plurality of tasks, wherein a transmission source task is connected to a message buffer reserved in advance, and a free queue for transmitting a message to a transmission destination task; whether processing of a message sent from the sender task in the previous task is delayed source
Determining means for determining based on the number of messages connected to the free queue , wherein the destination task is a first normal queue for receiving a message transmitted from the free queue, and processing is delayed in the determining means. If it is determined that the message has been transmitted, the first priority queue storing the message transmitted from the determined source task, and the message received in the first normal queue or the first priority queue is processed. An inter-task communication system comprising: a first processing unit. 2. The transmission source task according to claim 1 , wherein
And the processing is delayed, the
The message sent by the disk to the first normal queue.
Searched out of flowed messages, first searched
The message is reconnected to the first priority queue, and in the previous destination task, the processing unit stores the message in the first priority queue.
The message is placed in the first regular queue.
2. The inter-task communication system according to claim 1, wherein the connected messages are processed with priority . 3. A method according to claim 1, wherein said source task is a destination task.
When sending a message to another task,
Transmitted by relaying the task), the relay task receives the message sent from the free queue
A second normal queue, and a case where the determination unit determines that the processing is delayed.
In this case, the message sent from the source task
A second priority queue for storing the queue and the second normal queue or the second priority queue.
Second processing means for processing the received message, and a relay flag for relaying the determination result of the determination means.
Task communication system according to claim 1, characterized in that that.