JPH0389754A - Execution management processing system in communication control processing equipment - Google Patents

Abstract

PURPOSE:To suppress wasteful processing to minimum, and to shorten the processing time by adjusting the number of events stagnating in a main queue less than a fixed number by using an event input selecting function and an event circulating function. CONSTITUTION:The number of the events stagnating in the main queue 12 is adjusted to be less than the fixed number at every data link based on the pieces of information stagnating in sub-queues 12A to 12N prepared at every data link by the event input selecting function 61 and the event circulating function 62, and the number of the events stagnating in the main queue 12 is suppressed to necessary minimum at every data link. Thus, the occurrence of such a situation that the many events for which the data link stagnates in the main queue 12 and transmission becomes impossible can be prevented, and the wasteful processing at the time when frame transmission is impossible can be suppressed to the minimum, and the processing time can be shortened, and simultaneously, processing efficiency can be improved.

Description

[Detailed description of the invention]

[Industrial Application Field] The present invention relates to an execution management processing method in a communication control processing device that performs information transmission and reception processing in frame units based on high-level data transmission procedures (HDLC).For details, refer to O3I. The present invention relates to an execution management processing method in a communication control processing device that executes processing of a data link layer (hereinafter referred to as layer I) on a hierarchical structure of a model. [Prior Art] The processing in the layer (2) can be roughly divided into low-level processing and high-level processing. Here, low-level processing refers to interfacing to the physical layer (layer I), which is the adjacent lower layer, transmitting and receiving pit streams from/to the opposing device, flag detection, frame detection, frame checking, and combing. - This is a process of checking (Fe2) and decomposing each field. Further, high-level processing is processing that performs link management, order control, error control, etc. from the contents of each field. As an execution management processing method for a communication control processing device that realizes such layer processing, a method has been proposed in which the lower-level processing described above is performed using hardware, and the higher-level processing is performed using firmware using a general-purpose microprocessor. There is. This method is

[IEICE Technical Report Vol. 1.87. Regarding the evaluation and verification of the rlsDN protocol processing device published by the Institute of Electronics, Information and Communication Engineers (IEICE) Technical Research Report 9 (SE87-84)j]. FIG. 2 functionally shows the configuration of a conventional communication control processing device, focusing on processing when transmitting and receiving frames, which are the flow of information. In this illustrated example, the 15DN layer ① protocol processing device (hereinafter referred to as SIG) 1 corresponds to the communication control processing device, and this 5ICI is connected to the opposite device 2 and the higher-level device 3. The operation will be explained below. When the 5IGI receives a frame from the opposite device 2, it performs the following processing as a reception operation. 1) The reception event processing circuit 10 extracts the buffer for storing the reception frame from the empty buffer Boolean 11. 2) After storing the information of the received frame in the buffer, the reception event processing circuit 10 queues the fact that the frame has been received in the main queue (also called an execution management queue or a processing queue) 12. 3) Information stored in the buffer remains in the main queue 12. 4) By frame reception processing 13, main queue 1
Pull out the information stored in 2 and LA P-D
(Link Access Procedure on
the Dhannel) process. This LAP-D is based on the document [TTC standard “User
Network Interface, Volume 2, Part 1 (Published by Telegraph and Telephone Technology Committee)
Network interface (JT920, JT-Q921) Jl
As shown in Figure 3, this is a typical process in layer (2). 5) The information is notified to the higher-level device 3, and the reception processing circuit 30 of the higher-level device 3 performs the reception process. 6) After the reception processing in the host device 3 is completed, the buffer release processing circuit 14 stores the empty buffer in the empty buffer Boolean 11. Additionally, if it is necessary to issue a delivery confirmation frame, the following processing is performed. ) The frame reception processing circuit I3 pulls out a buffer for transmitting the acknowledgment frame from the empty buffer Boolean it, and queues the transmission of the acknowledgment frame in the main queue 12. i) Delivery confirmation frame information is retained in the main queue 12. iii) The frame transmission processing circuit 15 extracts the delivery confirmation frame information from the main queue 12 and performs the delivery confirmation frame transmission processing. IV) After the transmission process, the buffer release processing circuit 14 stores the empty buffer in the empty buffer Boolean. Also, when transmitting a frame from the host device 3,
5ICI performs the following processing as a transmission operation. A) Due to a buffer allocation request from the host device 3,
5IGI uses the buffer allocation processing circuit 16 to extract an empty buffer from the empty buffer Boolean 11 and notifies the host device 3 of the empty buffer. B) The transmission processing circuit 17 of the host device 3 stores the information and notifies the transmission event processing circuit 18 of the transmission request. C) The transmission event processing circuit 18 queues in the main queue 12 that there is a transmission request. D) Information on the transmitted frame remains in the main key 5-12. E) The frame transmission processing circuit 15 extracts the information of the transmission frames retained in the main queue 12, and
Perform AP-D processing. F> After the transmission is completed, the information stored in the buffer is retained in the unconfirmed frame boolean 19. Furthermore, when a delivery confirmation frame is received, the following processing is performed. b) The reception event processing circuit 10 extracts an empty buffer for storing the delivery confirmation framer from the empty buffer 11. After the frame is stored, the reception event processing circuit 10 queues in the main queue 12 that the delivery confirmation frame has been received. c) The information of the delivery confirmation frame is retained in the main queue 12. 2) The frame reception processing circuit 13 releases the buffer in the unconfirmed l frame boolean 19 and the delivery confirmation frame storage buffer. In the above-mentioned FIG. 2, the symbol "-〇→" indicates the specific flow of information stored in the buffer, and the number attached to the left shoulder of the symbol "○", Roman numeral,
Codes such as katakana indicate which step of the procedure is involved, and correspond to the codes used in the explanation of each processing procedure above. If we consider the above processing as an execution management processing method,
It will look like Figure 3. That is, the processing by the firmware is that of the interrupt level 40 that is processed by input/output requests from the outside, and as a normal operation, one of the various processing requests accumulated in the main queue 12 is taken out, the request content is analyzed, It can be roughly divided into 50 base levels that perform each type of processing. As shown in the figure, the processing at the interrupt level 40 involves an interrupt analysis circuit 41 analyzing the contents of the input/output request, and depending on the request, transmitting event processing circuit 18, receiving event processing circuit 10, and Processing is performed by the nofa allocation processing circuit 16, buffer release processing circuit 14, and the like. Further, the processing at the base level 50 is executed and managed using the main queue 12, the frame transmission processing circuit 15, and the frame reception processing circuit 13. The l frame transmission process in this execution management processing method is
Follow the flowchart in figure. The process shown in FIG.
Net Interface, Volume 2, Part 1 (Publishing Association Injection)
``15DN User Network Interface (JT-920゜JT-Q921)J'' in ``Telegraph and Telephone Technical Committee)''
]. Next, the flowchart shown in FIG. 4 will be explained. The multi-frame setting in the figure shows the internal state of 5IGI. When a DL-data request is notified as an l-frame transmission request from the higher-level device in a multi-frame setting state (step 1O1), the l-frame is sent to a subqueue (also called a queue when transmitting an I-frame) as the above-mentioned transmission event process. and sends a transmission request (connecting l frames to the queue) to the main queue to notify that there is a transmission request (step 103). As a result, the request remains in the queue and returns to the multiframe setting state (step 104). Next, if the event extracted from the main queue is a transmission request (step 105), it is determined whether or not one frame of the corresponding data link can be transmitted as frame transmission processing. The determination of whether or not transmission is possible is based on whether or not the receiving end is busy (step 106) and [V(S)V (A)+K
] holds true (step 107). If transmission is possible, first, the first I frame connected to the subqueue of the corresponding data link is taken out (step 108), and the I frame is transmitted. ■The process of transmitting a frame is the process of setting [P=O] (
The process consists of step 109) and a process of transmitting a command (step 110). Furthermore, after the transmission is started, the transmission state variable is updated [V (S) = V (S) + 1] in order to make the transmission frame remain in the unconfirmed frame pool as a post-processing (step 111), and then the confirmation is suspended. Clear the timer (step 112) and determine whether the timer is running (step 1).
13), and stopping and starting various timers (step 11)
4) in order and return to the multi-frame setting state (step 116). During the series of I frame transmission processing, when it is determined that the other party is busy receiving data or cannot be transmitted due to [V(S)=V(A)+K], a transmission request is issued again (step 115). Then, the event stays in the main queue, and the process returns to the multiframe setting state (step 116). The above operations are performed for each link because the data link specification supports multiple links. FIGS. 5(a), 5(b), and 5(c) show (1) frame transmission processing using event operations in the main queue. As shown in FIG. 5(a), when a DL data request from a higher-level device is notified, processing is performed by the transmission event processing circuit 18 at the interrupt level, and the transmission request event is placed in the main queue 12. , a plurality of subqueues 12A, 12B, prepared in advance for each link.
...12. A subqueue with a link to the event is selected from among the subqueues, information is put into the subqueue, and the process ends. Next, at the base level, one event retained in the main queue 12 is taken out, and if it is a transmission request event and can be transmitted by the frame transmission processing circuit 15, as shown in FIG. 5(b). , the corresponding link's subqueue 12. Extract the first information within and send it. Furthermore, when transmission is impossible, the transmission request event is returned to the main queue again, as shown in FIG. 5(C). [Problems to be Solved by the Invention] However, in the conventional execution management processing method shown in FIG. 5, when a DL-data request is notified from a host device, the process shown in FIG. As such, all transmission request events are placed in the main queue, regardless of the amount of information already stored in the subqueue. As a result, there are many cases where it becomes impossible to send,
There is a possibility that problems such as an increase in processing time and a decrease in processing efficiency may occur due to frequent occurrences of unnecessary repetition of transmission processing. Another disadvantage is that the main queue requires a large-capacity circuit. The present invention has been made in view of the above circumstances, and reduces processing time and improves processing efficiency by minimizing wasteful processing when frame transmission is not possible during frame transmission processing in a communication control processing device. can improve,
Moreover, it is an object of the present invention to provide an execution management processing method that can also reduce the capacity of the circuit that constitutes the main queue. [Means for Solving the Problems] The execution management processing method according to the present invention includes a main queue that accumulates events indicating the processing contents of input frames, and a main queue that stores the information of the frames in order to maintain the order of processing. This is an execution management processing method in a communication control processing device that includes a subqueue that is accumulated for each data link and performs information transmission and reception processing in frame units based on a high-level data transmission procedure. Specifically, as a means for solving the above problem, an event input selection function and an event circulation function are provided. Here, when a frame is input, the event input selection function detects the number of information already stored in the subqueue in which the information of that frame should be stored, and if the number of information is more than a certain number, This function avoids the accumulation of events of that frame in the main queue. In addition, when processing an event that has accumulated in the main queue, the event circulation function detects the number of information remaining in the subqueue that has stored information for that event, and if any information remains, is a function that returns events taken from the main queue to the main queue. The execution management processing method according to the present invention utilizes these event input selection functions and event circulation functions to adjust the number of events staying in the main queue to a certain number or less for each data link. The execution management processing method according to the present invention uses an event input selection function and an event circulation function to determine the number of events retained in the main queue based on the number of information retained in the subqueue prepared for each data link. By adjusting the number of events to a certain number or less for each data link, it is possible to suppress the number of events staying in the main queue to the necessary minimum for each data link. Therefore, it is possible to prevent a situation in which a large number of events for data links that cannot be sent remain in the main queue, minimizing wasteful processing when frames cannot be sent, and reducing processing time. At the same time, processing efficiency can be improved. Furthermore, since the number of events staying in the main queue is adjusted to a certain number or less, the capacity of the circuits forming the main queue can be reduced, and the cost of the device can also be reduced in terms of hardware. [Embodiment] FIGS. 1(a), (b), (C) and FIG. 6 show an embodiment of an execution management processing method in a communication processing device according to the present invention. The execution management processing method of this embodiment is shown in FIG. 1(a).
As shown in (b) and (c), main queue 1 accumulates events indicating the processing content of input frames.
2, and a subqueue 12 for storing the frame information for each data link A, B, and N in order to maintain order of processing.
A, 12. ,...12. and. It is an execution management processing method in a communication control processing device that performs information transmission and reception processing in frame units based on the high-level data transmission procedure (HDLC). The problem to be solved is to minimize wasteful transmission processing for data links. Specifically, it is provided with an event input selection function 61 as shown in FIG. 1(a), and an event circulation function 62 as shown in FIG. 1(b). Here, the event input selection function 61 selects when a frame (■ frame) is input (i.e., when a DL from a host device is input).
- When a data request is notified), this improves the processing by the transmission event processing circuit 18 at the interrupt level, and the subqueue (I
The number of information already accumulated in the frame transmission waiting queue is detected, and if there is accumulated information, the event of the frame is prevented from being accumulated in the main queue 12, and the event is queued in the corresponding link's subqueue. This is a function that only inputs information into the . In the example of FIG. 1(a), information A3 is stored in the subqueue 12A, but this subqueue 12A has already been stored with At and A.
Since there are two pieces of information (2), the event is
No new data is accumulated in the main queue 12. Furthermore, when the event circulation function 62 extracts and processes one event that has accumulated in the main key L-12 at the base level, the event circulation function 62 detects the number of information remaining in the subqueue that has accumulated information for that event. and if there is information remaining in that subqueue,
This is a function to return an event taken out from the main queue 12 to the main queue 12 again. The example in FIG. 1(b) shows a case where one event retained in the main queue 12 is taken out at the base level, and it is a transmission request event for link N and can be transmitted. In this case, Subki 2112,
Since the I frame information still remains in , the processed event n is returned to the main queue 12 again. In the execution management processing method of this embodiment, the event input selection function 61 and the event circulation function 62 are used to adjust the number of events retained in the main queue 12 to one for each data link. In frame transmission processing, if transmission is not possible, see Figure 1 (
As shown in C), the frame transmission processing circuit 15 returns the transmission request event to the main queue 12 again. The procedure of one frame transmission processing in one embodiment as described above will be explained based on the flowchart of FIG. 6. Note that the processing in this embodiment includes steps 200 to 207.
, consists of steps 301 to 314,
The notable difference from the conventional frame transmission processing procedure is steps 202, 206 . Steps 305, 308, etc.
It's in the newly added area. First, in the multi-frame setting state (step 200),
When a DL-data request is notified as an I-frame transmission request from a higher-level device (step 201), a subqueue (I-frame transmission waiting queue) of the notified data link is sent.
It is determined whether the value of the 1-queue counter that detects the number of information contained in the frame (number of I frames) is "O" (step 202). When it is "0", the transmission request (connecting the I frame to the queue) is put into the main queue (execution management queue) (step 204), and the information of the I frame is put into the corresponding data link subqueue (step 205). , the value of the queue counter of the corresponding data link is counted and amplified (step 206). If the value of the I-queue counter is not "O", no transmission request is generated, one frame of information is loaded into the subqueue of the corresponding data link (step 205), and the value of the I-queue counter of the corresponding data link is loaded. Count up (step 206). After step 206 is completed, the process returns to the multi-frame setting state again (step 207). On the other hand, if the information retrieved from the main queue is a transmission request (step 301), the frame transmission process involves determining whether or not the receiving party is busy (step 3).
02), and whether or not [V(S)=V(A)+K] holds (step 303), and based on these judgments, it is determined whether the I frame of the corresponding link can be transmitted. will be judged. If transmission is possible in steps 302 and 303, the first frame connected to the subqueue of the corresponding data link is taken out (step 304), and the value of the 1 queue counter of the corresponding data link is counted down. Step 305), as the process of transmitting the r frame, the process of setting [P-O] (step 306) and 1
A process of transmitting a command (step 307) is performed. After starting the transmission, it is determined whether the value of the I-queue counter of the corresponding data link is "O" (step 308), and if it is not "O", the transmission request is placed in the main queue (step 309). After determining the value of the I queue counter, as a subsequent process, update the transmission state variable [V (S) = v (s) + 1
] is executed (step 310), and the confirmation pending is cleared (step 311). Next, step 31 is performed to determine whether the timer is operating.
2), and stops and starts various timers (step 313), and returns to the multi-frame setting state (step 3).
15). During the series of I-frame transmission processing, if it is determined that transmission is not possible because the other party is busy receiving or [V (S) - V (A) + K], a transmission request is issued again (step 314), and the information is stays in the main queue,
The process returns to the multi-frame setting state (step 315). As is clear from the above explanation, in the execution management processing method of the embodiment, the number of events retained in the main queue 12 is prepared for each data link by the event input option selection function 61 and the event circulation function 62. subqueue 1
Based on the number of information stored in 2A, 12B, 128, the number of events stored in main key 12 is adjusted to a certain number or less for each data link.
It is possible to reduce the number of data links to the necessary minimum for each data link. Therefore, it is possible to prevent a situation in which a large number of events for data links that cannot be transmitted remain in the main queue 12, and to minimize unnecessary processing when frames cannot be transmitted, thereby reducing processing time. It is possible to shorten the time and improve processing efficiency. Furthermore, since the number of events staying in the main queue 12 is adjusted to a certain number or less, the capacity of the circuits that make up the main queue 12 can be reduced, and the cost of the device can also be reduced in terms of hardware. . In the above-mentioned embodiment, when a frame (r frame) is input, the event input selection function 61 selects the information already accumulated in the subqueue (I frame transmission waiting queue) in which the information of the frame should be stored. If the number of accumulated information is detected, the event of that frame is avoided from being accumulated in the main queue 12, but if the number of accumulated information in the subqueue exceeds a certain number. A method of avoiding accumulation only in the case of (for example, two or more) is also conceivable. Furthermore, the number of events retained in the main queue 12 is not limited to one for each data link as in the embodiment. For example, considering the processing speed of the frame transmission processing circuit 15, etc., it may be possible to limit the number of frames to a certain number or less, such as 2 or less or 3 or less for each data link, to avoid unnecessary transmission processing. In terms of reduction, it is possible to increase the effect. [Effects of the Invention] As explained in detail above, the execution management processing method according to the present invention uses the event input selection function and the event circulation function to reduce the number of events staying in main 1-1 for each data link. The number of events retained in the main queue is adjusted to a certain number or less for each data link based on the number of information retained in the subqueue prepared in the main queue. I can do it. Therefore, it is possible to prevent a situation in which a large number of events for data links that cannot be sent remain in the main queue, minimizing wasteful processing when frames cannot be sent, and reducing processing time. At the same time, processing efficiency can be improved. Furthermore, since the number of events staying in the main queue is adjusted to a certain number or less, the capacity of the circuits forming the main queue can be reduced, and the cost of the device can also be reduced in terms of hardware.

[Brief explanation of drawings]

FIGS. 1(a), (b), and (c) are explanatory diagrams of I frame transmission processing in an embodiment of the present invention, respectively;
Fig. 2 is a functional explanatory diagram of a conventional communication control processing device, Fig. 3 is a schematic explanatory diagram of execution management processing during frame transmission and reception, and Fig. 4
The figure is a flowchart showing the procedure of conventional I frame transmission processing, Figures 5 (a), (b), and (c) are explanatory diagrams of I frame transmission processing in the conventional execution management processing method, and Figure 6 is a flowchart showing the procedure of conventional I frame transmission processing. 3 is a flowchart showing the procedure of one frame transmission processing in an embodiment of the invention. 12... Main queue 12A, 12. ,...
...129...Sub queue 15...
. . . Frame transmission processing circuit, 18 . . . Transmission event processing circuit, 61 . . . Event input residual circuit,
62...Event circulation function.

Claims (1)

[Scope of Claims] A high performance data processing system comprising a main queue that accumulates events indicating processing contents of input frames, and a subqueue that accumulates information on the frames for each data link in order to maintain order of processing. An execution management processing method in a communication control processing device that performs information transmission and reception processing in frame units based on standard data transmission procedures, and when a frame is input, the information of that frame is already stored in the subqueue where it should be stored. It is equipped with an event input selection function that detects the number of information in the frame and, if the number of information exceeds a certain number, prevents the events of that frame from being accumulated in the main queue, and the event remains in the main queue. When processing an event, detect the amount of information remaining in the subqueue that had accumulated information for that event, and if any information remains, return the event taken from the main queue to the main queue again. A communication control processing device having an event circulation function, and adjusting the number of events staying in the main queue to a certain number or less for each data link by using the event input selection function and the event circulation function. Execution management processing method.