JPH01265340A - Queue buffer control system - Google Patents

Abstract

PURPOSE:To avoid such a case where a queue connected to a chain of a low level is not taken out forever by recording the AGE value showing a register history when the queue data is registered to a queue and then taking the queue data out of the queue selected based on the order of the AGE value. CONSTITUTION:A master AGE control part 4 delivers the basic AGE value which is counted up for each register request of the queue data. The queue level control parts 3 record the AGE value calculated from the basic AGE value received from the part 4 and the AGE arithmetic value corresponding to the level of the queue to be registered and contained in the AGE arithmetic value set previously in response to each level of the queue data every time the queue data is registered to the queue. When a queue data extracting request is received, the AGE values are compared with each other among those queues. Then the queue data are taken out of the queues 1a-1m selected according to the order of said AGE values. Thus it is possible to avoid such a case where the queues of low levels are not taken out forever.

Description

[Detailed Description of the Invention] [Field of Industrial Application] The present invention relates to a queue buffer management method that manages the registration and retrieval of queue data in a queue buffer used when exchanging data between tasks. .

[Conventional technology]

FIG. 6 is a schematic configuration diagram showing a conventional queue buffer management system. In the figure, 1 is a queue buffer provided with a plurality of queues 1a to 1m in which queue data is stored, and 2 is a queue buffer among the queues 1a to 1m. An empty queue management unit that connects and manages empty queues in a chain; 3 is a plurality of queue level management units 3a to 3 corresponding to the level of queue data;
This is a level management unit that connects and manages the queue data in the queues 1a to 1m stored in a chain corresponding to the level of the queue data.

, FIG. 7 shows each queue 1a to 1 of the queue buffer l.
This is a configuration diagram showing details of the queue m, and in the figure, 11 is a forward queue number area that stores the queue number of the queues 1a to 1m registered before that queue, and 12 is a forward queue number area that stores the queue numbers of queues 1a to 1m registered before that queue. A backward queue number area stores the queue numbers of the queues 1a to 1m, and 13 is a queue data area where cue data is stored.

FIG. 5 is a block diagram showing details of the free queue management section 2, and in the figure, 21 is connected to a chain of free queues managed by the free queue management section 2.
An empty queue number area 22 stores the number of queues for which no queue data is registered; 22 is a head empty queue number area storing the queue number of the queue connected to the beginning of the chain; and 23 is an area 23 at the end of the chain. This is the last free queue number area that stores the queue numbers of connected queues.

Furthermore, FIG. 8 is a configuration diagram showing details of each queue level management section 3a to 3n in the level management section 3, and in the figure, 31 is a level managed by the queue level management section 3a (to 3n). 32 is a level queue number area that stores the number of queues connected to the chain, 32 is a level head queue number area that stores the queue number of the queue connected to the beginning of the chain, and 23 is a level queue number area that stores the number of queues connected to the chain. This is the last level queue number area that stores the queue number of the queue that has been sent.

Next, the operation will be explained. FIG. 9 is a state transition diagram for explaining queue buffer management operations. FIG. 9 shows that the queue buffer 1 includes five queues 1a to 1e, and the level management unit 3 includes two queue level management units 3a and 3b corresponding to two levels, high and low. FIG. 9 (al shows the initial state in which no queue data is registered in any of the queues 1a to 1e,
Each of the queues 1a to 1e is sequentially connected to a chain of empty queue management sections 2. 9) shows a state in which four queue data are registered in the order of low level, high level, low level, and low level, and the chain of the queue level management unit 3a that manages the high level has queue data. Queues 1allC11d are respectively connected to the chain of the queue level management section 3b in which 1b manages the low level, and only the queue 1e remains in the chain of the free queue management section 2. FIG. 9(C) shows a state where one queue data is extracted from the state of FIG. 9(b), and the queue data is extracted from the queue 1b connected to the chain of the queue level management section 3a that manages the high level. The data is retrieved, and the queue 1b is connected to the end of the chain managed by the free queue management section 2. FIG. 9(d) shows a state in which one high-level queue data is registered in the state of FIG. 9(C), and that queue data is connected to the head of the chain managed by the free queue management section 2. The queue 1e is registered in the queue 1e that was previously used, and the queue le is connected to the chain managed by the queue level management section 3a.

Hereinafter, the procedure for registering and retrieving cue data will be explained in detail with reference to the drawings.

(2) A request to register low-level queue data is made in the state shown in FIG. 9(a).

■ Take out the queue 1a connected to the head of the chain managed by the free queue management section 2.

(i) Decrease the value in the number of free queues area 21 by "1".

(ii) The value of the rear queue number area 12 of the queue 1a is set in the empty head queue number area 22.

(iii) If the value of the empty queue number area 21 is "0", set the empty last queue number area 23 to "0".

(iv) If the value of the empty queue number area 21 is "1", the queue number of that queue is set in the empty last queue number area 23.

■ Corresponding queue level management unit 3b of level management unit 3
The queue 1a is connected to the chain managed by .

(i) Increase the value of the level queue number area 31 of the queue level management unit 3b by "1".

(ii) The value of the last level queue number field 33 of the queue level management section 3b is set in the forward queue number field 11 of the connected queue 1a.

(iii) Set the cue number "1" of the cue 1a in the last level cue number area 33 of the cue level management section 3b.

(iv) If the value in the level cue number field 31 of the cue level management unit 3b is "l", the cue number "l" of the cue 1a is set in the level head cue number field 32.

(v) "0" in the backward queue number area 12 of the queue 1a
Set.

■ Follow the steps from ■ to ■ above to transfer the next high-level cue data to queue 1b, the next low-level cue data to queue IC, and the next low-level cue data to queue 1.
d sequentially. At this time, in the backward queue number area 12 of the forward queue of the newly registered queue,
The queue number of the newly registered queue is set. As a result, the state transitions from FIG. 9(al) to FIG. 9(b).

(2) When a queue data retrieval request is made in the state shown in FIG. 9 (bl), data is retrieved from the highest level, so the queue 1b connected to the chain of the higher level queue level management section 3a is retrieved. At this time, the procedure for taking out the queue from the queue level management unit 3a is the same as the procedure in (2) above, and the procedure for connecting to the chain managed by the free queue management unit 2 is the same as in the procedures in (2) and (3) above. Transition from FIG. 9(b) to FIG. 9 (C1).

(2) Furthermore, in the state shown in FIG. 9(C), a request is made to register high-level queue data.

At this time, the procedure for taking out the queue from the empty queue management unit 2 is the same as the procedure in (2) above, and the procedure for connecting to the chain managed by the queue level management unit 3a is the same as in the procedures in (2) and (3) above. This causes the state to transition to FIG. 9 (from C1 to FIG. 9 fd).

[Problem to be solved by the invention]

Since the conventional queue buffer management system is configured as described above, when a request is made to retrieve queue data from state (d) in FIG. 9, the queue 1e connected to the higher level chain is retrieved again. queues la, lc, ld connected to the lower level chain.
had the problem that it would never be retrieved as long as a queue connected to a higher level chain existed.

The present invention has been made to solve the above-mentioned problems, and aims to provide a queue buffer management system that prevents low-level queues from being taken out forever.

[Means to solve the problem]

The queue buffer management method according to the present invention includes a master AGE management section that manages the age (AGE) of a queue buffer, and an AG corresponding to each level of queue data to be registered.
When setting the E calculation value and registering queue data in the queue, the basic AG generated by the master AGE management unit in the queue
The AGE value calculated from the E value and the AGE calculation value of the corresponding level is recorded, and when retrieving cue data, the cue data is retrieved from the selected queue according to the order of the /'CUE value of each cue. be.

[Effect]

The master AGE management unit in this invention outputs a basic AGE value that increments each time there is a request to register cue data, and the level management unit outputs a basic AGE value that increments each time there is a request to register cue data, and the level management unit outputs a basic AGE value that increments each time there is a request to register cue data. The basic output of A
The AGE value calculated from the GE value and the E calculation value corresponding to the level of the cue to be registered among the AGE calculation values set in advance for each level of cue data is recorded together, and the AGE value calculated from the AGE calculation value corresponding to the level of the cue to be registered is recorded together. When there is a retrieval request, the A of each queue
The GE values are compared and the queue data is extracted from the selected queue according to the order.

〔Example〕

An embodiment of the present invention will be described below with reference to the drawings. 1st
In the figure, 1 is a queue buffer, 1a to 1m are queues, 2 is an empty queue management section, 3 is a level management section, and 3a to 3
n is a queue level management unit, which is the same as that shown in FIG. 6 with the same reference numeral. Further, 4 is a master AGE management unit that generates a basic AGE value whose value is decremented by "1" each time there is a request to register cue data.

Here, the queues 1a to 1m are as shown in FIG.
Forward cue number area 11, backward cue number area 12
, the conventional cue la~ shown in FIG. This is different from 1m.

In addition, the queue level management units 3a to 3n are connected to the top of the chain that they manage, outside of the level queue number area 31, level first queue number area 32, and level last queue number area 33. Queue 1a (~1m)
A level AGE eJl area 34 is provided in which the AGE value recorded in the AGE 9M area 14 is stored, and an AGE calculation value corresponding to the level set in the corresponding queue level management section 3a (~3n) is provided. FIG. This is different from the conventional queue level management units 3a to 3n shown in FIG.

Next, the operation will be explained. FIG. 4 is a state transition diagram for explaining queue buffer management operations. Figure 4 shows five cues 1a to 1e, high and low 2, as before.
Level queue level management m3a.

3b, and FIG. 4(a) shows the initial state, FIG. 4('b) shows the state where four cue data are registered in the order of low level, high level, and low level. (C) shows a state in which one cue data has been extracted from the state of bl, and FIG. 4 (dl shows a state in which one high-level cue data has been registered in the state of C1). In addition, "100" is used as the initial value of the basic AGE value generated by the master AGE management unit 4, "2" is used as the high level AGE calculation value, and "2" is used as the low level AGE calculation value. "1" is set as the value for each.

Hereinafter, the procedure for registering and retrieving cue data will be explained in detail with reference to the drawings.

■ FIG. 9 (A request to register low-level queue data is made in the state al.

■ Take out the queue 1a connected to the head of the chain managed by the free queue management section 2.

(i) Decrease the value of the number of free queues area 21 by 1°.

(ii) The value of the backward queue number area 12 of the queue 1 is set in the empty head queue number area 22.

(iii) If the value of the empty queue number area 21 is "0", set the empty last queue number area 23 to "0".

(iv) If the value of the empty queue number area 21 is "1", the queue number of that queue is set in the empty last queue number area 23.

■ Corresponding queue level management unit 3b of level management unit 3
The queue 1a is connected to the chain managed by .

(i) Increase the value of the level queue number area 31 of the queue level management unit 3b by "1".

(ii) Forward queue number eM of connected queue 1a
The value of the last level cue number area 33 of the cue level management section 3b is set in the area 11.

(iii) The cue number "1" of the cue 1a is written in the last cue number area 33 of the cue level management section 3b.
Set.

(iv) If the value of the level cue number field 31 of the cue level management unit 3b is "1", the cue number "1" of the cue 1a is set in the level head cue number field 32.

(v) "0" in the backward queue number area 12 of the queue 1a
Set.

(vi) Add the AGE calculation value set corresponding to the level to the basic AGE value "100" generated by the master AGE management unit 2, and use it as the AEG value to set the AGE of the queue 1a.
Record it in eJl area 14. In this case, the registered cue data is at a low level, so the AGE calculation value is "1", so the AGE value "101", which is the sum of the basic AGE value "100" and this "1", is the queue 1aOA G E
It is set in fiI area 14.

(vi) If the value of the level queue number area of the queue level management unit 3b is “1”, the level AGE area 34 of the queue level management unit 3b is set to 1, and the AG of the AGE area 14 of -1a is
Set the E value “101”.

(vii) Basic AG generated by master AGE management unit 2
Subtract “1” from the E value.

(2) Following steps (1) to (2) above, the next high level queue data is registered in the queue 1b, the next low level data in the queue IC, and the next low level queue data in the queue 1d.

Therefore, the AGE area 14 of queue 1b contains 101'' (
99+2) is stored in the AGE area 14 of queue 1c.
” (98+1), and 98” (97+1) is recorded as the AGE value in the AGE area 14 of the queue 1d.

In addition, at this time, for the queue whose queue number is set in the forward queue number area 11 of the newly registered queue,
Thereafter, the cue number of the newly registered cue is set in the direction cue number area 12.

As a result, the state transitions from FIG. 9(al) to FIG. 9(bl).

(2) If a request is made to retrieve queue data in the state shown in FIG. 4(b), the data will be retrieved starting from the oldest (largest) AGE value.

(:) The AEG values stored in each level A GE area 34 are compared between the cue level management units 3a and 3b.

In this case, both levels AEG 'pM region 34 AEG
(Since i is equal to "101", in that case, the queue 1b connected to the chain managed by the high-level queue level management section 3a is taken out.

(ii) Decrease the value in the level queue count area 31 of the queue level management unit 3a by "1".

(iii) The backward queue number area 1 of the queue 1b is added to the level head queue number area 32 of the queue level management unit 3a.
Set the value of 2.

(iv) If the value in the level cue number area 31 is "0", set "0" in the level last cue number area 33 and set "0' in the level AGE area 34, respectively.

(v) If the value of the queue level number area 31 is "1",
The cue number of the cue is set in the level last cue number area 33.

(vi) If the value in the level cue number area 31 is "1" or more, the AGE value of the AGE area 14 of the cue with the cue number set in the level head cue number area 33 is set in the level AGE area 34.

■ Connect the empty queue 1b to the chain managed by the empty queue management section 2.

(i) Increase the value of the number of free queues area 21 of the free queue management unit 2 by "1".

(ii) Set the value of the last queue number field 23 of the empty queue management section 2 in the forward queue number field 11 of the queue 1b to be connected.

(iii) Set the queue number "2" of the queue 1b connected to the last queue number area of the empty queue management section 2.

(iv) If the value of the number of free queues area 21 is “1°,”
The queue number of the queue is set in the head queue number area 22 of the empty queue management section 2.

(v) Set "0" in the last queue number area 12 of the queue 1b.

(vi) If the value of the number of free queues area is “2” or more,
The registered queue number ``2'' of the connected queue 1b is set in the backward queue number area 12 of the queue 1e with the queue number ``5'' set in the forward queue number area 11 of the connected queue 1b. As a result, the state is as shown in Figure 4 (
Transition from b) to FIG. 4(C).

(2) Furthermore, in the state shown in FIG. 4(C), a request is made to register high-level queue data.

At this time, the procedure for taking out the queue from the empty queue management unit 1 is the same as the procedure in (2) above, and the procedure for registering it in the level 1 management unit 3a is the same as in the procedures in (1) to (3) above.

[Status (d)]

As a result, the state transitions from FIG. 4 (C1) to FIG. 4(d).

(2) If a request to retrieve the queue data is made in the state shown in FIG. 4(d), the steps (1) to (4) are repeated. In that case, the AGE value in the level AGEM area 34 of the queue level management unit 3a is “98”, and the AGE value in the level AGE area 34 of the queue level management unit 3b is “98”.
101'', the queue data is taken out from the queue 1a connected to the chain managed by the queue level management unit 3b having a large AGE value.

In the above embodiment, when registering cue data of two levels, high and low, the AGE calculation value is set to "2".

Although a fixed value of "1" is shown, each level queue management section 3a, 3b, 3n in FIG.
An E calculation value may be provided, and by providing this item, the extraction order for each level can be arbitrarily selected.

〔Effect of the invention〕

As described above, according to the present invention, when registering cue data in a queue, the AGE value indicating the registration layer is also recorded, and when the cue data is retrieved, the cue data is selected from the queue selected according to the order of the AGE value. Since the configuration is configured such that a queue connected to a low-level chain is not taken out forever, it is possible to obtain a queue buffer management method. .

[Brief explanation of the drawing]

FIG. 1 is a schematic configuration diagram showing a queue buffer management system according to an embodiment of the present invention, FIG. 2 is a configuration diagram showing details of the queue, FIG. 3 is a configuration diagram showing details of the level management section, and FIG. Figure 4 is a state transition diagram to explain its operation.
FIG. 5 is a block diagram showing details of the free queue management section of the present invention and the conventional free queue management unit. FIG. 6 is a schematic block diagram showing the conventional queue buffer management method. FIG. 7 is a block diagram showing details of the queue. Similarly, FIG. 8 is a configuration diagram showing details of the level management section, and FIG. 9 is a state transition diagram for explaining its operation. 1 is a queue buffer, 1a to 1m are queues, 2 is an empty queue management section, 3 is a level management section, and 4 is a master AGE management section. In addition, in the figures, the same reference numerals indicate the same or equivalent parts. -266・ 3" CIL, buds!

Claims (1)

[Claims] a queue buffer including a plurality of queues in which queue data is stored; a free queue management unit that connects and manages the vacant queues into a chain; and a level management unit that connects and manages the chain for each level, and when there is a request to register the queue data, the queue data is stored in the queue connected to the head of the chain managed by the free queue management unit. Then, the queue is connected to the chain at the level corresponding to the level of the queue data, and when there is a request to retrieve the queue data, the queue data is retrieved from the queue selected according to the level, and the queue becomes empty. In the queue buffer management method, a master AGE management unit is provided which increments and outputs a basic AGE value every time there is a request to register the queue data, and the level management unit A corresponding to each level in the section
When setting the GE calculation value and connecting a new queue to the chain managed by the level management section, the queue is
The AGE value calculated from the basic AGE value and the AGE calculation value of the corresponding level is recorded, and when there is a request to retrieve the queue data, the AGE values are compared, and the queue data is extracted from the queue selected according to the order. A Cuban fur management method that is characterized by taking out.